Lines Matching refs:bfqq
135 void bfq_mark_bfqq_##name(struct bfq_queue *bfqq) \
137 __set_bit(BFQQF_##name, &(bfqq)->flags); \
139 void bfq_clear_bfqq_##name(struct bfq_queue *bfqq) \
141 __clear_bit(BFQQF_##name, &(bfqq)->flags); \
143 int bfq_bfqq_##name(const struct bfq_queue *bfqq) \
145 return test_bit(BFQQF_##name, &(bfqq)->flags); \
236 #define BFQQ_SEEKY(bfqq) (hweight32(bfqq->seek_history) > 19) argument
244 #define BFQQ_TOTALLY_SEEKY(bfqq) (bfqq->seek_history == -1) argument
370 return bic->bfqq[is_sync]; in bic_to_bfqq()
373 void bic_set_bfqq(struct bfq_io_cq *bic, struct bfq_queue *bfqq, bool is_sync) in bic_set_bfqq() argument
375 bic->bfqq[is_sync] = bfqq; in bic_set_bfqq()
429 #define bfq_class_idle(bfqq) ((bfqq)->ioprio_class == IOPRIO_CLASS_IDLE) argument
430 #define bfq_class_rt(bfqq) ((bfqq)->ioprio_class == IOPRIO_CLASS_RT) 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()
622 if (bfq_too_late_for_merging(bfqq)) in bfq_pos_tree_add_move()
625 if (bfq_class_idle(bfqq)) in bfq_pos_tree_add_move()
627 if (!bfqq->next_rq) in bfq_pos_tree_add_move()
630 bfqq->pos_root = &bfq_bfqq_to_bfqg(bfqq)->rq_pos_tree; in bfq_pos_tree_add_move()
631 __bfqq = bfq_rq_pos_tree_lookup(bfqd, bfqq->pos_root, in bfq_pos_tree_add_move()
632 blk_rq_pos(bfqq->next_rq), &parent, &p); in bfq_pos_tree_add_move()
634 rb_link_node(&bfqq->pos_node, parent, p); in bfq_pos_tree_add_move()
635 rb_insert_color(&bfqq->pos_node, bfqq->pos_root); in bfq_pos_tree_add_move()
637 bfqq->pos_root = NULL; in bfq_pos_tree_add_move()
674 struct bfq_queue *bfqq) in bfq_asymmetric_scenario() argument
676 bool smallest_weight = bfqq && in bfq_asymmetric_scenario()
677 bfqq->weight_counter && in bfq_asymmetric_scenario()
678 bfqq->weight_counter == in bfq_asymmetric_scenario()
718 void bfq_weights_tree_add(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_weights_tree_add() argument
721 struct bfq_entity *entity = &bfqq->entity; in bfq_weights_tree_add()
737 if (bfqq->weight_counter) in bfq_weights_tree_add()
747 bfqq->weight_counter = __counter; in bfq_weights_tree_add()
758 bfqq->weight_counter = kzalloc(sizeof(struct bfq_weight_counter), in bfq_weights_tree_add()
773 if (unlikely(!bfqq->weight_counter)) in bfq_weights_tree_add()
776 bfqq->weight_counter->weight = entity->weight; in bfq_weights_tree_add()
777 rb_link_node(&bfqq->weight_counter->weights_node, parent, new); in bfq_weights_tree_add()
778 rb_insert_color_cached(&bfqq->weight_counter->weights_node, root, in bfq_weights_tree_add()
782 bfqq->weight_counter->num_active++; in bfq_weights_tree_add()
783 bfqq->ref++; in bfq_weights_tree_add()
793 struct bfq_queue *bfqq, in __bfq_weights_tree_remove() argument
796 if (!bfqq->weight_counter) in __bfq_weights_tree_remove()
799 bfqq->weight_counter->num_active--; in __bfq_weights_tree_remove()
800 if (bfqq->weight_counter->num_active > 0) in __bfq_weights_tree_remove()
803 rb_erase_cached(&bfqq->weight_counter->weights_node, root); in __bfq_weights_tree_remove()
804 kfree(bfqq->weight_counter); in __bfq_weights_tree_remove()
807 bfqq->weight_counter = NULL; in __bfq_weights_tree_remove()
808 bfq_put_queue(bfqq); in __bfq_weights_tree_remove()
816 struct bfq_queue *bfqq) in bfq_weights_tree_remove() argument
818 struct bfq_entity *entity = bfqq->entity.parent; in bfq_weights_tree_remove()
860 __bfq_weights_tree_remove(bfqd, bfqq, in bfq_weights_tree_remove()
867 static struct request *bfq_check_fifo(struct bfq_queue *bfqq, in bfq_check_fifo() argument
872 if (bfq_bfqq_fifo_expire(bfqq)) in bfq_check_fifo()
875 bfq_mark_bfqq_fifo_expire(bfqq); in bfq_check_fifo()
877 rq = rq_entry_fifo(bfqq->fifo.next); in bfq_check_fifo()
882 bfq_log_bfqq(bfqq->bfqd, bfqq, "check_fifo: returned %p", rq); in bfq_check_fifo()
887 struct bfq_queue *bfqq, in bfq_find_next_rq() argument
895 next = bfq_check_fifo(bfqq, last); in bfq_find_next_rq()
905 rbnext = rb_first(&bfqq->sort_list); in bfq_find_next_rq()
915 struct bfq_queue *bfqq) in bfq_serv_to_charge() argument
917 if (bfq_bfqq_sync(bfqq) || bfqq->wr_coeff > 1 || in bfq_serv_to_charge()
918 bfq_asymmetric_scenario(bfqq->bfqd, bfqq)) in bfq_serv_to_charge()
936 struct bfq_queue *bfqq) in bfq_updated_next_req() argument
938 struct bfq_entity *entity = &bfqq->entity; in bfq_updated_next_req()
939 struct request *next_rq = bfqq->next_rq; in bfq_updated_next_req()
945 if (bfqq == bfqd->in_service_queue) in bfq_updated_next_req()
953 max_t(unsigned long, bfqq->max_budget, in bfq_updated_next_req()
954 bfq_serv_to_charge(next_rq, bfqq)), in bfq_updated_next_req()
958 bfq_log_bfqq(bfqd, bfqq, "updated next rq: new budget %lu", in bfq_updated_next_req()
960 bfq_requeue_bfqq(bfqd, bfqq, false); in bfq_updated_next_req()
998 static void switch_back_to_interactive_wr(struct bfq_queue *bfqq, in switch_back_to_interactive_wr() argument
1001 bfqq->wr_coeff = bfqd->bfq_wr_coeff; in switch_back_to_interactive_wr()
1002 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); in switch_back_to_interactive_wr()
1003 bfqq->last_wr_start_finish = bfqq->wr_start_at_switch_to_srt; in switch_back_to_interactive_wr()
1007 bfq_bfqq_resume_state(struct bfq_queue *bfqq, struct bfq_data *bfqd, in bfq_bfqq_resume_state() argument
1010 unsigned int old_wr_coeff = bfqq->wr_coeff; in bfq_bfqq_resume_state()
1011 bool busy = bfq_already_existing && bfq_bfqq_busy(bfqq); in bfq_bfqq_resume_state()
1014 bfq_mark_bfqq_has_short_ttime(bfqq); in bfq_bfqq_resume_state()
1016 bfq_clear_bfqq_has_short_ttime(bfqq); in bfq_bfqq_resume_state()
1019 bfq_mark_bfqq_IO_bound(bfqq); in bfq_bfqq_resume_state()
1021 bfq_clear_bfqq_IO_bound(bfqq); in bfq_bfqq_resume_state()
1023 bfqq->entity.new_weight = bic->saved_weight; in bfq_bfqq_resume_state()
1024 bfqq->ttime = bic->saved_ttime; in bfq_bfqq_resume_state()
1025 bfqq->wr_coeff = bic->saved_wr_coeff; in bfq_bfqq_resume_state()
1026 bfqq->wr_start_at_switch_to_srt = bic->saved_wr_start_at_switch_to_srt; in bfq_bfqq_resume_state()
1027 bfqq->last_wr_start_finish = bic->saved_last_wr_start_finish; in bfq_bfqq_resume_state()
1028 bfqq->wr_cur_max_time = bic->saved_wr_cur_max_time; in bfq_bfqq_resume_state()
1030 if (bfqq->wr_coeff > 1 && (bfq_bfqq_in_large_burst(bfqq) || in bfq_bfqq_resume_state()
1031 time_is_before_jiffies(bfqq->last_wr_start_finish + in bfq_bfqq_resume_state()
1032 bfqq->wr_cur_max_time))) { in bfq_bfqq_resume_state()
1033 if (bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time && in bfq_bfqq_resume_state()
1034 !bfq_bfqq_in_large_burst(bfqq) && in bfq_bfqq_resume_state()
1035 time_is_after_eq_jiffies(bfqq->wr_start_at_switch_to_srt + in bfq_bfqq_resume_state()
1037 switch_back_to_interactive_wr(bfqq, bfqd); in bfq_bfqq_resume_state()
1039 bfqq->wr_coeff = 1; in bfq_bfqq_resume_state()
1040 bfq_log_bfqq(bfqq->bfqd, bfqq, in bfq_bfqq_resume_state()
1046 bfqq->entity.prio_changed = 1; in bfq_bfqq_resume_state()
1051 if (old_wr_coeff == 1 && bfqq->wr_coeff > 1) in bfq_bfqq_resume_state()
1053 else if (old_wr_coeff > 1 && bfqq->wr_coeff == 1) in bfq_bfqq_resume_state()
1057 static int bfqq_process_refs(struct bfq_queue *bfqq) in bfqq_process_refs() argument
1059 return bfqq->ref - bfqq->allocated - bfqq->entity.on_st - in bfqq_process_refs()
1060 (bfqq->weight_counter != NULL); in bfqq_process_refs()
1064 static void bfq_reset_burst_list(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_reset_burst_list() argument
1078 hlist_add_head(&bfqq->burst_list_node, &bfqd->burst_list); in bfq_reset_burst_list()
1083 bfqd->burst_parent_entity = bfqq->entity.parent; in bfq_reset_burst_list()
1087 static void bfq_add_to_burst(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_add_to_burst() argument
1109 bfq_mark_bfqq_in_large_burst(bfqq); in bfq_add_to_burst()
1127 hlist_add_head(&bfqq->burst_list_node, &bfqd->burst_list); in bfq_add_to_burst()
1239 static void bfq_handle_burst(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_handle_burst() argument
1246 if (!hlist_unhashed(&bfqq->burst_list_node) || in bfq_handle_burst()
1247 bfq_bfqq_in_large_burst(bfqq) || in bfq_handle_burst()
1248 time_is_after_eq_jiffies(bfqq->split_time + in bfq_handle_burst()
1271 bfqq->entity.parent != bfqd->burst_parent_entity) { in bfq_handle_burst()
1273 bfq_reset_burst_list(bfqd, bfqq); in bfq_handle_burst()
1283 bfq_mark_bfqq_in_large_burst(bfqq); in bfq_handle_burst()
1292 bfq_add_to_burst(bfqd, bfqq); in bfq_handle_burst()
1305 static int bfq_bfqq_budget_left(struct bfq_queue *bfqq) in bfq_bfqq_budget_left() argument
1307 struct bfq_entity *entity = &bfqq->entity; in bfq_bfqq_budget_left()
1442 struct bfq_queue *bfqq, in bfq_bfqq_update_budg_for_activation() argument
1445 struct bfq_entity *entity = &bfqq->entity; in bfq_bfqq_update_budg_for_activation()
1454 if (bfq_bfqq_non_blocking_wait_rq(bfqq) && arrived_in_time && in bfq_bfqq_update_budg_for_activation()
1455 bfq_bfqq_budget_left(bfqq) > 0) { in bfq_bfqq_update_budg_for_activation()
1474 bfq_bfqq_budget_left(bfqq), in bfq_bfqq_update_budg_for_activation()
1475 bfqq->max_budget); in bfq_bfqq_update_budg_for_activation()
1495 entity->budget = max_t(unsigned long, bfqq->max_budget, in bfq_bfqq_update_budg_for_activation()
1496 bfq_serv_to_charge(bfqq->next_rq, bfqq)); in bfq_bfqq_update_budg_for_activation()
1497 bfq_clear_bfqq_non_blocking_wait_rq(bfqq); in bfq_bfqq_update_budg_for_activation()
1511 struct bfq_queue *bfqq, in bfq_update_bfqq_wr_on_rq_arrival() argument
1521 bfqq->service_from_wr = 0; in bfq_update_bfqq_wr_on_rq_arrival()
1522 bfqq->wr_coeff = bfqd->bfq_wr_coeff; in bfq_update_bfqq_wr_on_rq_arrival()
1523 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); in bfq_update_bfqq_wr_on_rq_arrival()
1536 bfqq->wr_start_at_switch_to_srt = in bfq_update_bfqq_wr_on_rq_arrival()
1538 bfqq->wr_coeff = bfqd->bfq_wr_coeff * in bfq_update_bfqq_wr_on_rq_arrival()
1540 bfqq->wr_cur_max_time = in bfq_update_bfqq_wr_on_rq_arrival()
1553 bfqq->entity.budget = min_t(unsigned long, in bfq_update_bfqq_wr_on_rq_arrival()
1554 bfqq->entity.budget, in bfq_update_bfqq_wr_on_rq_arrival()
1558 bfqq->wr_coeff = bfqd->bfq_wr_coeff; in bfq_update_bfqq_wr_on_rq_arrival()
1559 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); in bfq_update_bfqq_wr_on_rq_arrival()
1561 bfqq->wr_coeff = 1; in bfq_update_bfqq_wr_on_rq_arrival()
1592 if (bfqq->wr_cur_max_time != in bfq_update_bfqq_wr_on_rq_arrival()
1594 bfqq->wr_start_at_switch_to_srt = in bfq_update_bfqq_wr_on_rq_arrival()
1595 bfqq->last_wr_start_finish; in bfq_update_bfqq_wr_on_rq_arrival()
1597 bfqq->wr_cur_max_time = in bfq_update_bfqq_wr_on_rq_arrival()
1599 bfqq->wr_coeff = bfqd->bfq_wr_coeff * in bfq_update_bfqq_wr_on_rq_arrival()
1602 bfqq->last_wr_start_finish = jiffies; in bfq_update_bfqq_wr_on_rq_arrival()
1608 struct bfq_queue *bfqq) in bfq_bfqq_idle_for_long_time() argument
1610 return bfqq->dispatched == 0 && in bfq_bfqq_idle_for_long_time()
1612 bfqq->budget_timeout + in bfq_bfqq_idle_for_long_time()
1621 static bool bfq_bfqq_higher_class_or_weight(struct bfq_queue *bfqq, in bfq_bfqq_higher_class_or_weight() argument
1626 if (bfqq->ioprio_class < in_serv_bfqq->ioprio_class) in bfq_bfqq_higher_class_or_weight()
1629 if (in_serv_bfqq->entity.parent == bfqq->entity.parent) { in bfq_bfqq_higher_class_or_weight()
1630 bfqq_weight = bfqq->entity.weight; in bfq_bfqq_higher_class_or_weight()
1633 if (bfqq->entity.parent) in bfq_bfqq_higher_class_or_weight()
1634 bfqq_weight = bfqq->entity.parent->weight; in bfq_bfqq_higher_class_or_weight()
1636 bfqq_weight = bfqq->entity.weight; in bfq_bfqq_higher_class_or_weight()
1647 struct bfq_queue *bfqq, in bfq_bfqq_handle_idle_busy_switch() argument
1654 idle_for_long_time = bfq_bfqq_idle_for_long_time(bfqd, bfqq), in bfq_bfqq_handle_idle_busy_switch()
1661 bfqq->ttime.last_end_request + in bfq_bfqq_handle_idle_busy_switch()
1672 in_burst = bfq_bfqq_in_large_burst(bfqq); in bfq_bfqq_handle_idle_busy_switch()
1674 !BFQQ_TOTALLY_SEEKY(bfqq) && in bfq_bfqq_handle_idle_busy_switch()
1676 time_is_before_jiffies(bfqq->soft_rt_next_start) && in bfq_bfqq_handle_idle_busy_switch()
1677 bfqq->dispatched == 0; in bfq_bfqq_handle_idle_busy_switch()
1680 (bfqq->wr_coeff > 1 || in bfq_bfqq_handle_idle_busy_switch()
1681 (bfq_bfqq_sync(bfqq) && in bfq_bfqq_handle_idle_busy_switch()
1682 bfqq->bic && (*interactive || soft_rt))); in bfq_bfqq_handle_idle_busy_switch()
1689 bfq_bfqq_update_budg_for_activation(bfqd, bfqq, in bfq_bfqq_handle_idle_busy_switch()
1705 if (likely(!bfq_bfqq_just_created(bfqq)) && in bfq_bfqq_handle_idle_busy_switch()
1708 bfqq->budget_timeout + in bfq_bfqq_handle_idle_busy_switch()
1710 hlist_del_init(&bfqq->burst_list_node); in bfq_bfqq_handle_idle_busy_switch()
1711 bfq_clear_bfqq_in_large_burst(bfqq); in bfq_bfqq_handle_idle_busy_switch()
1714 bfq_clear_bfqq_just_created(bfqq); in bfq_bfqq_handle_idle_busy_switch()
1717 if (!bfq_bfqq_IO_bound(bfqq)) { in bfq_bfqq_handle_idle_busy_switch()
1719 bfqq->requests_within_timer++; in bfq_bfqq_handle_idle_busy_switch()
1720 if (bfqq->requests_within_timer >= in bfq_bfqq_handle_idle_busy_switch()
1722 bfq_mark_bfqq_IO_bound(bfqq); in bfq_bfqq_handle_idle_busy_switch()
1724 bfqq->requests_within_timer = 0; in bfq_bfqq_handle_idle_busy_switch()
1728 if (unlikely(time_is_after_jiffies(bfqq->split_time))) in bfq_bfqq_handle_idle_busy_switch()
1730 bfqq->split_time = in bfq_bfqq_handle_idle_busy_switch()
1733 if (time_is_before_jiffies(bfqq->split_time + in bfq_bfqq_handle_idle_busy_switch()
1735 bfq_update_bfqq_wr_on_rq_arrival(bfqd, bfqq, in bfq_bfqq_handle_idle_busy_switch()
1742 if (old_wr_coeff != bfqq->wr_coeff) in bfq_bfqq_handle_idle_busy_switch()
1743 bfqq->entity.prio_changed = 1; in bfq_bfqq_handle_idle_busy_switch()
1747 bfqq->last_idle_bklogged = jiffies; in bfq_bfqq_handle_idle_busy_switch()
1748 bfqq->service_from_backlogged = 0; in bfq_bfqq_handle_idle_busy_switch()
1749 bfq_clear_bfqq_softrt_update(bfqq); in bfq_bfqq_handle_idle_busy_switch()
1751 bfq_add_bfqq_busy(bfqd, bfqq); in bfq_bfqq_handle_idle_busy_switch()
1787 bfqq->wr_coeff >= bfqd->in_service_queue->wr_coeff) || in bfq_bfqq_handle_idle_busy_switch()
1788 bfq_bfqq_higher_class_or_weight(bfqq, bfqd->in_service_queue)) && in bfq_bfqq_handle_idle_busy_switch()
1795 struct bfq_queue *bfqq) in bfq_reset_inject_limit() argument
1798 bfqq->last_serv_time_ns = 0; in bfq_reset_inject_limit()
1852 if (bfq_bfqq_has_short_ttime(bfqq)) in bfq_reset_inject_limit()
1853 bfqq->inject_limit = 0; in bfq_reset_inject_limit()
1855 bfqq->inject_limit = 1; in bfq_reset_inject_limit()
1857 bfqq->decrease_time_jif = jiffies; in bfq_reset_inject_limit()
1862 struct bfq_queue *bfqq = RQ_BFQQ(rq); in bfq_add_request() local
1863 struct bfq_data *bfqd = bfqq->bfqd; in bfq_add_request()
1865 unsigned int old_wr_coeff = bfqq->wr_coeff; in bfq_add_request()
1868 bfq_log_bfqq(bfqd, bfqq, "add_request %d", rq_is_sync(rq)); in bfq_add_request()
1869 bfqq->queued[rq_is_sync(rq)]++; in bfq_add_request()
1872 if (RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_bfqq_sync(bfqq)) { in bfq_add_request()
1928 !bfq_bfqq_has_short_ttime(bfqq) && in bfq_add_request()
1931 if (bfqd->last_completed_rq_bfqq != bfqq && in bfq_add_request()
1933 bfqq->waker_bfqq) { in bfq_add_request()
1940 bfqq->waker_bfqq = bfqd->last_completed_rq_bfqq; in bfq_add_request()
1962 if (!hlist_unhashed(&bfqq->woken_list_node)) in bfq_add_request()
1963 hlist_del_init(&bfqq->woken_list_node); in bfq_add_request()
1964 hlist_add_head(&bfqq->woken_list_node, in bfq_add_request()
1967 bfq_clear_bfqq_has_waker(bfqq); in bfq_add_request()
1969 bfqq->waker_bfqq && in bfq_add_request()
1970 !bfq_bfqq_has_waker(bfqq)) { in bfq_add_request()
1975 bfq_mark_bfqq_has_waker(bfqq); in bfq_add_request()
1985 if (time_is_before_eq_jiffies(bfqq->decrease_time_jif + in bfq_add_request()
1987 bfq_reset_inject_limit(bfqd, bfqq); in bfq_add_request()
2014 if (bfqq == bfqd->in_service_queue && in bfq_add_request()
2016 (bfqq->last_serv_time_ns > 0 && in bfq_add_request()
2018 time_is_before_eq_jiffies(bfqq->decrease_time_jif + in bfq_add_request()
2046 elv_rb_add(&bfqq->sort_list, rq); in bfq_add_request()
2051 prev = bfqq->next_rq; in bfq_add_request()
2052 next_rq = bfq_choose_req(bfqd, bfqq->next_rq, rq, bfqd->last_position); in bfq_add_request()
2053 bfqq->next_rq = next_rq; in bfq_add_request()
2059 if (unlikely(!bfqd->nonrot_with_queueing && prev != bfqq->next_rq)) in bfq_add_request()
2060 bfq_pos_tree_add_move(bfqd, bfqq); in bfq_add_request()
2062 if (!bfq_bfqq_busy(bfqq)) /* switching to busy ... */ in bfq_add_request()
2063 bfq_bfqq_handle_idle_busy_switch(bfqd, bfqq, old_wr_coeff, in bfq_add_request()
2068 bfqq->last_wr_start_finish + in bfq_add_request()
2070 bfqq->wr_coeff = bfqd->bfq_wr_coeff; in bfq_add_request()
2071 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); in bfq_add_request()
2074 bfqq->entity.prio_changed = 1; in bfq_add_request()
2076 if (prev != bfqq->next_rq) in bfq_add_request()
2077 bfq_updated_next_req(bfqd, bfqq); in bfq_add_request()
2107 (old_wr_coeff == 1 || bfqq->wr_coeff == 1 || interactive)) in bfq_add_request()
2108 bfqq->last_wr_start_finish = jiffies; in bfq_add_request()
2115 struct bfq_queue *bfqq = bfqd->bio_bfqq; in bfq_find_rq_fmerge() local
2118 if (bfqq) in bfq_find_rq_fmerge()
2119 return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio)); in bfq_find_rq_fmerge()
2151 struct bfq_queue *bfqq = RQ_BFQQ(rq); in bfq_remove_request() local
2152 struct bfq_data *bfqd = bfqq->bfqd; in bfq_remove_request()
2155 if (bfqq->next_rq == rq) { in bfq_remove_request()
2156 bfqq->next_rq = bfq_find_next_rq(bfqd, bfqq, rq); in bfq_remove_request()
2157 bfq_updated_next_req(bfqd, bfqq); in bfq_remove_request()
2162 bfqq->queued[sync]--; in bfq_remove_request()
2164 elv_rb_del(&bfqq->sort_list, rq); in bfq_remove_request()
2170 if (RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_remove_request()
2171 bfqq->next_rq = NULL; in bfq_remove_request()
2173 if (bfq_bfqq_busy(bfqq) && bfqq != bfqd->in_service_queue) { in bfq_remove_request()
2174 bfq_del_bfqq_busy(bfqd, bfqq, false); in bfq_remove_request()
2188 bfqq->entity.budget = bfqq->entity.service = 0; in bfq_remove_request()
2194 if (bfqq->pos_root) { in bfq_remove_request()
2195 rb_erase(&bfqq->pos_node, bfqq->pos_root); in bfq_remove_request()
2196 bfqq->pos_root = NULL; in bfq_remove_request()
2201 bfq_pos_tree_add_move(bfqd, bfqq); in bfq_remove_request()
2205 bfqq->meta_pending--; in bfq_remove_request()
2267 struct bfq_queue *bfqq = bfq_init_rq(req); in bfq_request_merged() local
2271 if (!bfqq) in bfq_request_merged()
2274 bfqd = bfqq->bfqd; in bfq_request_merged()
2277 elv_rb_del(&bfqq->sort_list, req); in bfq_request_merged()
2278 elv_rb_add(&bfqq->sort_list, req); in bfq_request_merged()
2281 prev = bfqq->next_rq; in bfq_request_merged()
2282 next_rq = bfq_choose_req(bfqd, bfqq->next_rq, req, in bfq_request_merged()
2284 bfqq->next_rq = next_rq; in bfq_request_merged()
2290 if (prev != bfqq->next_rq) { in bfq_request_merged()
2291 bfq_updated_next_req(bfqd, bfqq); in bfq_request_merged()
2297 bfq_pos_tree_add_move(bfqd, bfqq); in bfq_request_merged()
2319 struct bfq_queue *bfqq = bfq_init_rq(rq), in bfq_requests_merged() local
2322 if (!bfqq) in bfq_requests_merged()
2334 if (bfqq == next_bfqq && in bfq_requests_merged()
2342 if (bfqq->next_rq == next) in bfq_requests_merged()
2343 bfqq->next_rq = rq; in bfq_requests_merged()
2345 bfqg_stats_update_io_merged(bfqq_group(bfqq), next->cmd_flags); in bfq_requests_merged()
2349 static void bfq_bfqq_end_wr(struct bfq_queue *bfqq) in bfq_bfqq_end_wr() argument
2351 if (bfq_bfqq_busy(bfqq)) in bfq_bfqq_end_wr()
2352 bfqq->bfqd->wr_busy_queues--; in bfq_bfqq_end_wr()
2353 bfqq->wr_coeff = 1; in bfq_bfqq_end_wr()
2354 bfqq->wr_cur_max_time = 0; in bfq_bfqq_end_wr()
2355 bfqq->last_wr_start_finish = jiffies; in bfq_bfqq_end_wr()
2360 bfqq->entity.prio_changed = 1; in bfq_bfqq_end_wr()
2378 struct bfq_queue *bfqq; in bfq_end_wr() local
2382 list_for_each_entry(bfqq, &bfqd->active_list, bfqq_list) in bfq_end_wr()
2383 bfq_bfqq_end_wr(bfqq); in bfq_end_wr()
2384 list_for_each_entry(bfqq, &bfqd->idle_list, bfqq_list) in bfq_end_wr()
2385 bfq_bfqq_end_wr(bfqq); in bfq_end_wr()
2407 struct bfq_queue *bfqq, in bfqq_find_close()
2410 struct rb_root *root = &bfq_bfqq_to_bfqg(bfqq)->rq_pos_tree; in bfqq_find_close()
2452 struct bfq_queue *bfqq; in bfq_find_close_cooperator() local
2461 bfqq = bfqq_find_close(bfqd, cur_bfqq, sector); in bfq_find_close_cooperator()
2462 if (!bfqq || bfqq == cur_bfqq) in bfq_find_close_cooperator()
2465 return bfqq; in bfq_find_close_cooperator()
2469 bfq_setup_merge(struct bfq_queue *bfqq, struct bfq_queue *new_bfqq) in bfq_setup_merge() argument
2485 if (__bfqq == bfqq) in bfq_setup_merge()
2490 process_refs = bfqq_process_refs(bfqq); in bfq_setup_merge()
2499 bfq_log_bfqq(bfqq->bfqd, bfqq, "scheduling merge with queue %d", in bfq_setup_merge()
2522 bfqq->new_bfqq = new_bfqq; in bfq_setup_merge()
2527 static bool bfq_may_be_close_cooperator(struct bfq_queue *bfqq, in bfq_may_be_close_cooperator() argument
2533 if (bfq_class_idle(bfqq) || bfq_class_idle(new_bfqq) || in bfq_may_be_close_cooperator()
2534 (bfqq->ioprio_class != new_bfqq->ioprio_class)) in bfq_may_be_close_cooperator()
2542 if (BFQQ_SEEKY(bfqq) || BFQQ_SEEKY(new_bfqq)) in bfq_may_be_close_cooperator()
2550 if (!bfq_bfqq_sync(bfqq) || !bfq_bfqq_sync(new_bfqq)) in bfq_may_be_close_cooperator()
2577 bfq_setup_cooperator(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_setup_cooperator() argument
2633 if (bfq_too_late_for_merging(bfqq)) in bfq_setup_cooperator()
2636 if (bfqq->new_bfqq) in bfq_setup_cooperator()
2637 return bfqq->new_bfqq; in bfq_setup_cooperator()
2639 if (!io_struct || unlikely(bfqq == &bfqd->oom_bfqq)) in bfq_setup_cooperator()
2648 if (in_service_bfqq && in_service_bfqq != bfqq && in bfq_setup_cooperator()
2652 bfqq->entity.parent == in_service_bfqq->entity.parent && in bfq_setup_cooperator()
2653 bfq_may_be_close_cooperator(bfqq, in_service_bfqq)) { in bfq_setup_cooperator()
2654 new_bfqq = bfq_setup_merge(bfqq, in_service_bfqq); in bfq_setup_cooperator()
2663 new_bfqq = bfq_find_close_cooperator(bfqd, bfqq, in bfq_setup_cooperator()
2667 bfq_may_be_close_cooperator(bfqq, new_bfqq)) in bfq_setup_cooperator()
2668 return bfq_setup_merge(bfqq, new_bfqq); in bfq_setup_cooperator()
2673 static void bfq_bfqq_save_state(struct bfq_queue *bfqq) in bfq_bfqq_save_state() argument
2675 struct bfq_io_cq *bic = bfqq->bic; in bfq_bfqq_save_state()
2685 bic->saved_weight = bfqq->entity.orig_weight; in bfq_bfqq_save_state()
2686 bic->saved_ttime = bfqq->ttime; in bfq_bfqq_save_state()
2687 bic->saved_has_short_ttime = bfq_bfqq_has_short_ttime(bfqq); in bfq_bfqq_save_state()
2688 bic->saved_IO_bound = bfq_bfqq_IO_bound(bfqq); in bfq_bfqq_save_state()
2689 bic->saved_in_large_burst = bfq_bfqq_in_large_burst(bfqq); in bfq_bfqq_save_state()
2690 bic->was_in_burst_list = !hlist_unhashed(&bfqq->burst_list_node); in bfq_bfqq_save_state()
2691 if (unlikely(bfq_bfqq_just_created(bfqq) && in bfq_bfqq_save_state()
2692 !bfq_bfqq_in_large_burst(bfqq) && in bfq_bfqq_save_state()
2693 bfqq->bfqd->low_latency)) { in bfq_bfqq_save_state()
2703 bic->saved_wr_coeff = bfqq->bfqd->bfq_wr_coeff; in bfq_bfqq_save_state()
2705 bic->saved_wr_cur_max_time = bfq_wr_duration(bfqq->bfqd); in bfq_bfqq_save_state()
2708 bic->saved_wr_coeff = bfqq->wr_coeff; in bfq_bfqq_save_state()
2710 bfqq->wr_start_at_switch_to_srt; in bfq_bfqq_save_state()
2711 bic->saved_last_wr_start_finish = bfqq->last_wr_start_finish; in bfq_bfqq_save_state()
2712 bic->saved_wr_cur_max_time = bfqq->wr_cur_max_time; in bfq_bfqq_save_state()
2718 void bfq_release_process_ref(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_release_process_ref() argument
2731 if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_release_process_ref()
2732 bfqq != bfqd->in_service_queue) in bfq_release_process_ref()
2733 bfq_del_bfqq_busy(bfqd, bfqq, false); in bfq_release_process_ref()
2735 bfq_put_queue(bfqq); in bfq_release_process_ref()
2740 struct bfq_queue *bfqq, struct bfq_queue *new_bfqq) in bfq_merge_bfqqs() argument
2742 bfq_log_bfqq(bfqd, bfqq, "merging with queue %lu", in bfq_merge_bfqqs()
2745 bfq_bfqq_save_state(bfqq); in bfq_merge_bfqqs()
2747 if (bfq_bfqq_IO_bound(bfqq)) in bfq_merge_bfqqs()
2749 bfq_clear_bfqq_IO_bound(bfqq); in bfq_merge_bfqqs()
2760 if (new_bfqq->wr_coeff == 1 && bfqq->wr_coeff > 1) { in bfq_merge_bfqqs()
2761 new_bfqq->wr_coeff = bfqq->wr_coeff; in bfq_merge_bfqqs()
2762 new_bfqq->wr_cur_max_time = bfqq->wr_cur_max_time; in bfq_merge_bfqqs()
2763 new_bfqq->last_wr_start_finish = bfqq->last_wr_start_finish; in bfq_merge_bfqqs()
2765 bfqq->wr_start_at_switch_to_srt; in bfq_merge_bfqqs()
2771 if (bfqq->wr_coeff > 1) { /* bfqq has given its wr to new_bfqq */ in bfq_merge_bfqqs()
2772 bfqq->wr_coeff = 1; in bfq_merge_bfqqs()
2773 bfqq->entity.prio_changed = 1; in bfq_merge_bfqqs()
2774 if (bfq_bfqq_busy(bfqq)) in bfq_merge_bfqqs()
2807 bfqq->bic = NULL; in bfq_merge_bfqqs()
2808 bfq_release_process_ref(bfqd, bfqq); in bfq_merge_bfqqs()
2816 struct bfq_queue *bfqq = bfqd->bio_bfqq, *new_bfqq; in bfq_allow_bio_merge() local
2828 if (!bfqq) in bfq_allow_bio_merge()
2835 new_bfqq = bfq_setup_cooperator(bfqd, bfqq, bio, false); in bfq_allow_bio_merge()
2844 bfq_merge_bfqqs(bfqd, bfqd->bio_bic, bfqq, in bfq_allow_bio_merge()
2851 bfqq = new_bfqq; in bfq_allow_bio_merge()
2859 bfqd->bio_bfqq = bfqq; in bfq_allow_bio_merge()
2862 return bfqq == RQ_BFQQ(rq); in bfq_allow_bio_merge()
2872 struct bfq_queue *bfqq) in bfq_set_budget_timeout() argument
2876 if (bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time) in bfq_set_budget_timeout()
2879 timeout_coeff = bfqq->entity.weight / bfqq->entity.orig_weight; in bfq_set_budget_timeout()
2883 bfqq->budget_timeout = jiffies + in bfq_set_budget_timeout()
2888 struct bfq_queue *bfqq) in __bfq_set_in_service_queue() argument
2890 if (bfqq) { in __bfq_set_in_service_queue()
2891 bfq_clear_bfqq_fifo_expire(bfqq); in __bfq_set_in_service_queue()
2895 if (time_is_before_jiffies(bfqq->last_wr_start_finish) && in __bfq_set_in_service_queue()
2896 bfqq->wr_coeff > 1 && in __bfq_set_in_service_queue()
2897 bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time && in __bfq_set_in_service_queue()
2898 time_is_before_jiffies(bfqq->budget_timeout)) { in __bfq_set_in_service_queue()
2923 if (time_after(bfqq->budget_timeout, in __bfq_set_in_service_queue()
2924 bfqq->last_wr_start_finish)) in __bfq_set_in_service_queue()
2925 bfqq->last_wr_start_finish += in __bfq_set_in_service_queue()
2926 jiffies - bfqq->budget_timeout; in __bfq_set_in_service_queue()
2928 bfqq->last_wr_start_finish = jiffies; in __bfq_set_in_service_queue()
2931 bfq_set_budget_timeout(bfqd, bfqq); in __bfq_set_in_service_queue()
2932 bfq_log_bfqq(bfqd, bfqq, in __bfq_set_in_service_queue()
2934 bfqq->entity.budget); in __bfq_set_in_service_queue()
2937 bfqd->in_service_queue = bfqq; in __bfq_set_in_service_queue()
2945 struct bfq_queue *bfqq = bfq_get_next_queue(bfqd); in bfq_set_in_service_queue() local
2947 __bfq_set_in_service_queue(bfqd, bfqq); in bfq_set_in_service_queue()
2948 return bfqq; in bfq_set_in_service_queue()
2953 struct bfq_queue *bfqq = bfqd->in_service_queue; in bfq_arm_slice_timer() local
2956 bfq_mark_bfqq_wait_request(bfqq); in bfq_arm_slice_timer()
2974 if (BFQQ_SEEKY(bfqq) && bfqq->wr_coeff == 1 && in bfq_arm_slice_timer()
2975 !bfq_asymmetric_scenario(bfqd, bfqq)) in bfq_arm_slice_timer()
2977 else if (bfqq->wr_coeff > 1) in bfq_arm_slice_timer()
2985 bfqg_stats_set_start_idle_time(bfqq_group(bfqq)); in bfq_arm_slice_timer()
3238 struct bfq_queue *bfqq = RQ_BFQQ(rq); in bfq_dispatch_remove() local
3252 bfqq->dispatched++; in bfq_dispatch_remove()
3445 struct bfq_queue *bfqq) in idling_needed_for_service_guarantees() argument
3447 return (bfqq->wr_coeff > 1 && in idling_needed_for_service_guarantees()
3451 bfqq->dispatched + 4)) || in idling_needed_for_service_guarantees()
3452 bfq_asymmetric_scenario(bfqd, bfqq); in idling_needed_for_service_guarantees()
3455 static bool __bfq_bfqq_expire(struct bfq_data *bfqd, struct bfq_queue *bfqq, in __bfq_bfqq_expire() argument
3464 if (bfq_bfqq_coop(bfqq) && BFQQ_SEEKY(bfqq)) in __bfq_bfqq_expire()
3465 bfq_mark_bfqq_split_coop(bfqq); in __bfq_bfqq_expire()
3480 if (RB_EMPTY_ROOT(&bfqq->sort_list) && in __bfq_bfqq_expire()
3482 idling_needed_for_service_guarantees(bfqd, bfqq))) { in __bfq_bfqq_expire()
3483 if (bfqq->dispatched == 0) in __bfq_bfqq_expire()
3490 bfqq->budget_timeout = jiffies; in __bfq_bfqq_expire()
3492 bfq_del_bfqq_busy(bfqd, bfqq, true); in __bfq_bfqq_expire()
3494 bfq_requeue_bfqq(bfqd, bfqq, true); in __bfq_bfqq_expire()
3500 !RB_EMPTY_ROOT(&bfqq->sort_list))) in __bfq_bfqq_expire()
3501 bfq_pos_tree_add_move(bfqd, bfqq); in __bfq_bfqq_expire()
3524 struct bfq_queue *bfqq, in __bfq_bfqq_recalc_budget() argument
3532 if (bfqq->wr_coeff == 1) in __bfq_bfqq_recalc_budget()
3533 budget = bfqq->max_budget; in __bfq_bfqq_recalc_budget()
3542 bfq_log_bfqq(bfqd, bfqq, "recalc_budg: last budg %d, budg left %d", in __bfq_bfqq_recalc_budget()
3543 bfqq->entity.budget, bfq_bfqq_budget_left(bfqq)); in __bfq_bfqq_recalc_budget()
3544 bfq_log_bfqq(bfqd, bfqq, "recalc_budg: last max_budg %d, min budg %d", in __bfq_bfqq_recalc_budget()
3546 bfq_log_bfqq(bfqd, bfqq, "recalc_budg: sync %d, seeky %d", in __bfq_bfqq_recalc_budget()
3547 bfq_bfqq_sync(bfqq), BFQQ_SEEKY(bfqd->in_service_queue)); in __bfq_bfqq_recalc_budget()
3549 if (bfq_bfqq_sync(bfqq) && bfqq->wr_coeff == 1) { in __bfq_bfqq_recalc_budget()
3580 if (bfqq->dispatched > 0) /* still outstanding reqs */ in __bfq_bfqq_recalc_budget()
3643 budget = max_t(int, bfqq->entity.service, min_budget); in __bfq_bfqq_recalc_budget()
3648 } else if (!bfq_bfqq_sync(bfqq)) { in __bfq_bfqq_recalc_budget()
3658 bfqq->max_budget = budget; in __bfq_bfqq_recalc_budget()
3662 bfqq->max_budget = min(bfqq->max_budget, bfqd->bfq_max_budget); in __bfq_bfqq_recalc_budget()
3674 next_rq = bfqq->next_rq; in __bfq_bfqq_recalc_budget()
3676 bfqq->entity.budget = max_t(unsigned long, bfqq->max_budget, in __bfq_bfqq_recalc_budget()
3677 bfq_serv_to_charge(next_rq, bfqq)); in __bfq_bfqq_recalc_budget()
3679 bfq_log_bfqq(bfqd, bfqq, "head sect: %u, new budget %d", in __bfq_bfqq_recalc_budget()
3681 bfqq->entity.budget); in __bfq_bfqq_recalc_budget()
3715 static bool bfq_bfqq_is_slow(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_bfqq_is_slow() argument
3721 bool slow = BFQQ_SEEKY(bfqq); /* if delta too short, use seekyness */ in bfq_bfqq_is_slow()
3723 if (!bfq_bfqq_sync(bfqq)) in bfq_bfqq_is_slow()
3764 slow = bfqq->entity.service < bfqd->bfq_max_budget / 2; in bfq_bfqq_is_slow()
3767 bfq_log_bfqq(bfqd, bfqq, "bfq_bfqq_is_slow: slow %d", slow); in bfq_bfqq_is_slow()
3866 struct bfq_queue *bfqq) in bfq_bfqq_softrt_next_start() argument
3868 return max3(bfqq->soft_rt_next_start, in bfq_bfqq_softrt_next_start()
3869 bfqq->last_idle_bklogged + in bfq_bfqq_softrt_next_start()
3870 HZ * bfqq->service_from_backlogged / in bfq_bfqq_softrt_next_start()
3872 jiffies + nsecs_to_jiffies(bfqq->bfqd->bfq_slice_idle) + 4); in bfq_bfqq_softrt_next_start()
3902 struct bfq_queue *bfqq, in bfq_bfqq_expire() argument
3908 struct bfq_entity *entity = &bfqq->entity; in bfq_bfqq_expire()
3913 slow = bfq_bfqq_is_slow(bfqd, bfqq, compensate, reason, &delta); in bfq_bfqq_expire()
3930 if (bfqq->wr_coeff == 1 && in bfq_bfqq_expire()
3933 bfq_bfqq_budget_left(bfqq) >= entity->budget / 3))) in bfq_bfqq_expire()
3934 bfq_bfqq_charge_time(bfqd, bfqq, delta); in bfq_bfqq_expire()
3938 bfq_clear_bfqq_IO_bound(bfqq); in bfq_bfqq_expire()
3940 if (bfqd->low_latency && bfqq->wr_coeff == 1) in bfq_bfqq_expire()
3941 bfqq->last_wr_start_finish = jiffies; in bfq_bfqq_expire()
3944 RB_EMPTY_ROOT(&bfqq->sort_list)) { in bfq_bfqq_expire()
3971 if (bfqq->dispatched == 0 && in bfq_bfqq_expire()
3972 bfqq->wr_coeff != bfqd->bfq_wr_coeff) in bfq_bfqq_expire()
3973 bfqq->soft_rt_next_start = in bfq_bfqq_expire()
3974 bfq_bfqq_softrt_next_start(bfqd, bfqq); in bfq_bfqq_expire()
3975 else if (bfqq->dispatched > 0) { in bfq_bfqq_expire()
3980 bfq_mark_bfqq_softrt_update(bfqq); in bfq_bfqq_expire()
3984 bfq_log_bfqq(bfqd, bfqq, in bfq_bfqq_expire()
3986 slow, bfqq->dispatched, bfq_bfqq_has_short_ttime(bfqq)); in bfq_bfqq_expire()
4000 __bfq_bfqq_recalc_budget(bfqd, bfqq, reason); in bfq_bfqq_expire()
4001 if (__bfq_bfqq_expire(bfqd, bfqq, reason)) in bfq_bfqq_expire()
4006 if (!bfq_bfqq_busy(bfqq) && in bfq_bfqq_expire()
4009 bfq_mark_bfqq_non_blocking_wait_rq(bfqq); in bfq_bfqq_expire()
4045 static bool bfq_bfqq_budget_timeout(struct bfq_queue *bfqq) in bfq_bfqq_budget_timeout() argument
4047 return time_is_before_eq_jiffies(bfqq->budget_timeout); in bfq_bfqq_budget_timeout()
4058 static bool bfq_may_expire_for_budg_timeout(struct bfq_queue *bfqq) in bfq_may_expire_for_budg_timeout() argument
4060 bfq_log_bfqq(bfqq->bfqd, bfqq, in bfq_may_expire_for_budg_timeout()
4062 bfq_bfqq_wait_request(bfqq), in bfq_may_expire_for_budg_timeout()
4063 bfq_bfqq_budget_left(bfqq) >= bfqq->entity.budget / 3, in bfq_may_expire_for_budg_timeout()
4064 bfq_bfqq_budget_timeout(bfqq)); in bfq_may_expire_for_budg_timeout()
4066 return (!bfq_bfqq_wait_request(bfqq) || in bfq_may_expire_for_budg_timeout()
4067 bfq_bfqq_budget_left(bfqq) >= bfqq->entity.budget / 3) in bfq_may_expire_for_budg_timeout()
4069 bfq_bfqq_budget_timeout(bfqq); in bfq_may_expire_for_budg_timeout()
4073 struct bfq_queue *bfqq) in idling_boosts_thr_without_issues() argument
4080 bfqq_sequential_and_IO_bound = !BFQQ_SEEKY(bfqq) && in idling_boosts_thr_without_issues()
4081 bfq_bfqq_IO_bound(bfqq) && bfq_bfqq_has_short_ttime(bfqq); in idling_boosts_thr_without_issues()
4168 static bool bfq_better_to_idle(struct bfq_queue *bfqq) in bfq_better_to_idle() argument
4170 struct bfq_data *bfqd = bfqq->bfqd; in bfq_better_to_idle()
4184 if (bfqd->bfq_slice_idle == 0 || !bfq_bfqq_sync(bfqq) || in bfq_better_to_idle()
4185 bfq_class_idle(bfqq)) in bfq_better_to_idle()
4189 idling_boosts_thr_without_issues(bfqd, bfqq); in bfq_better_to_idle()
4192 idling_needed_for_service_guarantees(bfqd, bfqq); in bfq_better_to_idle()
4215 static bool bfq_bfqq_must_idle(struct bfq_queue *bfqq) in bfq_bfqq_must_idle() argument
4217 return RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_better_to_idle(bfqq); in bfq_bfqq_must_idle()
4230 struct bfq_queue *bfqq, *in_serv_bfqq = bfqd->in_service_queue; in bfq_choose_bfqq_for_injection() local
4278 list_for_each_entry(bfqq, &bfqd->active_list, bfqq_list) in bfq_choose_bfqq_for_injection()
4279 if (!RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_choose_bfqq_for_injection()
4280 (in_serv_always_inject || bfqq->wr_coeff > 1) && in bfq_choose_bfqq_for_injection()
4281 bfq_serv_to_charge(bfqq->next_rq, bfqq) <= in bfq_choose_bfqq_for_injection()
4282 bfq_bfqq_budget_left(bfqq)) { in bfq_choose_bfqq_for_injection()
4301 blk_rq_sectors(bfqq->next_rq) >= in bfq_choose_bfqq_for_injection()
4309 return bfqq; in bfq_choose_bfqq_for_injection()
4322 struct bfq_queue *bfqq; in bfq_select_queue() local
4326 bfqq = bfqd->in_service_queue; in bfq_select_queue()
4327 if (!bfqq) in bfq_select_queue()
4330 bfq_log_bfqq(bfqd, bfqq, "select_queue: already in-service queue"); in bfq_select_queue()
4339 if (bfq_may_expire_for_budg_timeout(bfqq) && in bfq_select_queue()
4340 !bfq_bfqq_must_idle(bfqq)) in bfq_select_queue()
4350 next_rq = bfqq->next_rq; in bfq_select_queue()
4356 if (bfq_serv_to_charge(next_rq, bfqq) > in bfq_select_queue()
4357 bfq_bfqq_budget_left(bfqq)) { in bfq_select_queue()
4372 if (bfq_bfqq_wait_request(bfqq)) { in bfq_select_queue()
4386 bfq_clear_bfqq_wait_request(bfqq); in bfq_select_queue()
4401 if (bfq_bfqq_wait_request(bfqq) || in bfq_select_queue()
4402 (bfqq->dispatched != 0 && bfq_better_to_idle(bfqq))) { in bfq_select_queue()
4404 bfqq->bic && bfqq->bic->bfqq[0] && in bfq_select_queue()
4405 bfq_bfqq_busy(bfqq->bic->bfqq[0]) && in bfq_select_queue()
4406 bfqq->bic->bfqq[0]->next_rq ? in bfq_select_queue()
4407 bfqq->bic->bfqq[0] : NULL; in bfq_select_queue()
4482 icq_to_bic(async_bfqq->next_rq->elv.icq) == bfqq->bic && in bfq_select_queue()
4485 bfqq = bfqq->bic->bfqq[0]; in bfq_select_queue()
4486 else if (bfq_bfqq_has_waker(bfqq) && in bfq_select_queue()
4487 bfq_bfqq_busy(bfqq->waker_bfqq) && in bfq_select_queue()
4488 bfqq->next_rq && in bfq_select_queue()
4489 bfq_serv_to_charge(bfqq->waker_bfqq->next_rq, in bfq_select_queue()
4490 bfqq->waker_bfqq) <= in bfq_select_queue()
4491 bfq_bfqq_budget_left(bfqq->waker_bfqq) in bfq_select_queue()
4493 bfqq = bfqq->waker_bfqq; in bfq_select_queue()
4494 else if (!idling_boosts_thr_without_issues(bfqd, bfqq) && in bfq_select_queue()
4495 (bfqq->wr_coeff == 1 || bfqd->wr_busy_queues > 1 || in bfq_select_queue()
4496 !bfq_bfqq_has_short_ttime(bfqq))) in bfq_select_queue()
4497 bfqq = bfq_choose_bfqq_for_injection(bfqd); in bfq_select_queue()
4499 bfqq = NULL; in bfq_select_queue()
4506 bfq_bfqq_expire(bfqd, bfqq, false, reason); in bfq_select_queue()
4508 bfqq = bfq_set_in_service_queue(bfqd); in bfq_select_queue()
4509 if (bfqq) { in bfq_select_queue()
4510 bfq_log_bfqq(bfqd, bfqq, "select_queue: checking new queue"); in bfq_select_queue()
4514 if (bfqq) in bfq_select_queue()
4515 bfq_log_bfqq(bfqd, bfqq, "select_queue: returned this queue"); in bfq_select_queue()
4519 return bfqq; in bfq_select_queue()
4522 static void bfq_update_wr_data(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_update_wr_data() argument
4524 struct bfq_entity *entity = &bfqq->entity; in bfq_update_wr_data()
4526 if (bfqq->wr_coeff > 1) { /* queue is being weight-raised */ in bfq_update_wr_data()
4527 bfq_log_bfqq(bfqd, bfqq, in bfq_update_wr_data()
4529 jiffies_to_msecs(jiffies - bfqq->last_wr_start_finish), in bfq_update_wr_data()
4530 jiffies_to_msecs(bfqq->wr_cur_max_time), in bfq_update_wr_data()
4531 bfqq->wr_coeff, in bfq_update_wr_data()
4532 bfqq->entity.weight, bfqq->entity.orig_weight); in bfq_update_wr_data()
4535 bfq_log_bfqq(bfqd, bfqq, "WARN: pending prio change"); in bfq_update_wr_data()
4542 if (bfq_bfqq_in_large_burst(bfqq)) in bfq_update_wr_data()
4543 bfq_bfqq_end_wr(bfqq); in bfq_update_wr_data()
4544 else if (time_is_before_jiffies(bfqq->last_wr_start_finish + in bfq_update_wr_data()
4545 bfqq->wr_cur_max_time)) { in bfq_update_wr_data()
4546 if (bfqq->wr_cur_max_time != bfqd->bfq_wr_rt_max_time || in bfq_update_wr_data()
4547 time_is_before_jiffies(bfqq->wr_start_at_switch_to_srt + in bfq_update_wr_data()
4549 bfq_bfqq_end_wr(bfqq); in bfq_update_wr_data()
4551 switch_back_to_interactive_wr(bfqq, bfqd); in bfq_update_wr_data()
4552 bfqq->entity.prio_changed = 1; in bfq_update_wr_data()
4555 if (bfqq->wr_coeff > 1 && in bfq_update_wr_data()
4556 bfqq->wr_cur_max_time != bfqd->bfq_wr_rt_max_time && in bfq_update_wr_data()
4557 bfqq->service_from_wr > max_service_from_wr) { in bfq_update_wr_data()
4559 bfq_bfqq_end_wr(bfqq); in bfq_update_wr_data()
4570 if ((entity->weight > entity->orig_weight) != (bfqq->wr_coeff > 1)) in bfq_update_wr_data()
4579 struct bfq_queue *bfqq) in bfq_dispatch_rq_from_bfqq() argument
4581 struct request *rq = bfqq->next_rq; in bfq_dispatch_rq_from_bfqq()
4584 service_to_charge = bfq_serv_to_charge(rq, bfqq); in bfq_dispatch_rq_from_bfqq()
4586 bfq_bfqq_served(bfqq, service_to_charge); in bfq_dispatch_rq_from_bfqq()
4588 if (bfqq == bfqd->in_service_queue && bfqd->wait_dispatch) { in bfq_dispatch_rq_from_bfqq()
4595 if (bfqq != bfqd->in_service_queue) in bfq_dispatch_rq_from_bfqq()
4609 bfq_update_wr_data(bfqd, bfqq); in bfq_dispatch_rq_from_bfqq()
4616 if (!(bfq_tot_busy_queues(bfqd) > 1 && bfq_class_idle(bfqq))) in bfq_dispatch_rq_from_bfqq()
4619 bfq_bfqq_expire(bfqd, bfqq, false, BFQQE_BUDGET_EXHAUSTED); in bfq_dispatch_rq_from_bfqq()
4641 struct bfq_queue *bfqq = NULL; in __bfq_dispatch_request() local
4648 bfqq = RQ_BFQQ(rq); in __bfq_dispatch_request()
4650 if (bfqq) { in __bfq_dispatch_request()
4657 bfqq->dispatched++; in __bfq_dispatch_request()
4709 bfqq = bfq_select_queue(bfqd); in __bfq_dispatch_request()
4710 if (!bfqq) in __bfq_dispatch_request()
4713 rq = bfq_dispatch_rq_from_bfqq(bfqd, bfqq); in __bfq_dispatch_request()
4731 struct bfq_queue *bfqq = rq ? RQ_BFQQ(rq) : NULL; in bfq_update_dispatch_stats() local
4733 if (!idle_timer_disabled && !bfqq) in bfq_update_dispatch_stats()
4761 if (bfqq) { in bfq_update_dispatch_stats()
4762 struct bfq_group *bfqg = bfqq_group(bfqq); in bfq_update_dispatch_stats()
4809 void bfq_put_queue(struct bfq_queue *bfqq) in bfq_put_queue() argument
4814 struct bfq_group *bfqg = bfqq_group(bfqq); in bfq_put_queue()
4817 if (bfqq->bfqd) in bfq_put_queue()
4818 bfq_log_bfqq(bfqq->bfqd, bfqq, "put_queue: %p %d", in bfq_put_queue()
4819 bfqq, bfqq->ref); in bfq_put_queue()
4821 bfqq->ref--; in bfq_put_queue()
4822 if (bfqq->ref) in bfq_put_queue()
4825 if (!hlist_unhashed(&bfqq->burst_list_node)) { in bfq_put_queue()
4826 hlist_del_init(&bfqq->burst_list_node); in bfq_put_queue()
4853 if (bfqq->bic && bfqq->bfqd->burst_size > 0) in bfq_put_queue()
4854 bfqq->bfqd->burst_size--; in bfq_put_queue()
4873 if (!hlist_unhashed(&bfqq->woken_list_node)) in bfq_put_queue()
4874 hlist_del_init(&bfqq->woken_list_node); in bfq_put_queue()
4877 hlist_for_each_entry_safe(item, n, &bfqq->woken_list, in bfq_put_queue()
4884 if (bfqq->bfqd && bfqq->bfqd->last_completed_rq_bfqq == bfqq) in bfq_put_queue()
4885 bfqq->bfqd->last_completed_rq_bfqq = NULL; in bfq_put_queue()
4887 kmem_cache_free(bfq_pool, bfqq); in bfq_put_queue()
4893 static void bfq_put_cooperator(struct bfq_queue *bfqq) in bfq_put_cooperator() argument
4902 __bfqq = bfqq->new_bfqq; in bfq_put_cooperator()
4904 if (__bfqq == bfqq) in bfq_put_cooperator()
4912 static void bfq_exit_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq) in bfq_exit_bfqq() argument
4914 if (bfqq == bfqd->in_service_queue) { in bfq_exit_bfqq()
4915 __bfq_bfqq_expire(bfqd, bfqq, BFQQE_BUDGET_TIMEOUT); in bfq_exit_bfqq()
4919 bfq_log_bfqq(bfqd, bfqq, "exit_bfqq: %p, %d", bfqq, bfqq->ref); in bfq_exit_bfqq()
4921 bfq_put_cooperator(bfqq); in bfq_exit_bfqq()
4923 bfq_release_process_ref(bfqd, bfqq); in bfq_exit_bfqq()
4928 struct bfq_queue *bfqq = bic_to_bfqq(bic, is_sync); in bfq_exit_icq_bfqq() local
4931 if (bfqq) in bfq_exit_icq_bfqq()
4932 bfqd = bfqq->bfqd; /* NULL if scheduler already exited */ in bfq_exit_icq_bfqq()
4934 if (bfqq && bfqd) { in bfq_exit_icq_bfqq()
4938 bfqq->bic = NULL; in bfq_exit_icq_bfqq()
4939 bfq_exit_bfqq(bfqd, bfqq); in bfq_exit_icq_bfqq()
4958 bfq_set_next_ioprio_data(struct bfq_queue *bfqq, struct bfq_io_cq *bic) in bfq_set_next_ioprio_data() argument
4962 struct bfq_data *bfqd = bfqq->bfqd; in bfq_set_next_ioprio_data()
4970 dev_err(bfqq->bfqd->queue->backing_dev_info->dev, in bfq_set_next_ioprio_data()
4977 bfqq->new_ioprio = task_nice_ioprio(tsk); in bfq_set_next_ioprio_data()
4978 bfqq->new_ioprio_class = task_nice_ioclass(tsk); in bfq_set_next_ioprio_data()
4981 bfqq->new_ioprio = IOPRIO_PRIO_DATA(bic->ioprio); in bfq_set_next_ioprio_data()
4982 bfqq->new_ioprio_class = IOPRIO_CLASS_RT; in bfq_set_next_ioprio_data()
4985 bfqq->new_ioprio = IOPRIO_PRIO_DATA(bic->ioprio); in bfq_set_next_ioprio_data()
4986 bfqq->new_ioprio_class = IOPRIO_CLASS_BE; in bfq_set_next_ioprio_data()
4989 bfqq->new_ioprio_class = IOPRIO_CLASS_IDLE; in bfq_set_next_ioprio_data()
4990 bfqq->new_ioprio = 7; in bfq_set_next_ioprio_data()
4994 if (bfqq->new_ioprio >= IOPRIO_BE_NR) { in bfq_set_next_ioprio_data()
4996 bfqq->new_ioprio); in bfq_set_next_ioprio_data()
4997 bfqq->new_ioprio = IOPRIO_BE_NR; in bfq_set_next_ioprio_data()
5000 bfqq->entity.new_weight = bfq_ioprio_to_weight(bfqq->new_ioprio); in bfq_set_next_ioprio_data()
5001 bfqq->entity.prio_changed = 1; in bfq_set_next_ioprio_data()
5011 struct bfq_queue *bfqq; in bfq_check_ioprio_change() local
5023 bfqq = bic_to_bfqq(bic, false); in bfq_check_ioprio_change()
5024 if (bfqq) { in bfq_check_ioprio_change()
5025 bfq_release_process_ref(bfqd, bfqq); in bfq_check_ioprio_change()
5026 bfqq = bfq_get_queue(bfqd, bio, BLK_RW_ASYNC, bic); in bfq_check_ioprio_change()
5027 bic_set_bfqq(bic, bfqq, false); in bfq_check_ioprio_change()
5030 bfqq = bic_to_bfqq(bic, true); in bfq_check_ioprio_change()
5031 if (bfqq) in bfq_check_ioprio_change()
5032 bfq_set_next_ioprio_data(bfqq, bic); in bfq_check_ioprio_change()
5035 static void bfq_init_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_init_bfqq() argument
5038 RB_CLEAR_NODE(&bfqq->entity.rb_node); in bfq_init_bfqq()
5039 INIT_LIST_HEAD(&bfqq->fifo); in bfq_init_bfqq()
5040 INIT_HLIST_NODE(&bfqq->burst_list_node); in bfq_init_bfqq()
5041 INIT_HLIST_NODE(&bfqq->woken_list_node); in bfq_init_bfqq()
5042 INIT_HLIST_HEAD(&bfqq->woken_list); in bfq_init_bfqq()
5044 bfqq->ref = 0; in bfq_init_bfqq()
5045 bfqq->bfqd = bfqd; in bfq_init_bfqq()
5048 bfq_set_next_ioprio_data(bfqq, bic); in bfq_init_bfqq()
5056 if (!bfq_class_idle(bfqq)) in bfq_init_bfqq()
5058 bfq_mark_bfqq_has_short_ttime(bfqq); in bfq_init_bfqq()
5059 bfq_mark_bfqq_sync(bfqq); in bfq_init_bfqq()
5060 bfq_mark_bfqq_just_created(bfqq); in bfq_init_bfqq()
5062 bfq_clear_bfqq_sync(bfqq); in bfq_init_bfqq()
5065 bfqq->ttime.last_end_request = ktime_get_ns() + 1; in bfq_init_bfqq()
5067 bfq_mark_bfqq_IO_bound(bfqq); in bfq_init_bfqq()
5069 bfqq->pid = pid; in bfq_init_bfqq()
5072 bfqq->max_budget = (2 * bfq_max_budget(bfqd)) / 3; in bfq_init_bfqq()
5073 bfqq->budget_timeout = bfq_smallest_from_now(); in bfq_init_bfqq()
5075 bfqq->wr_coeff = 1; in bfq_init_bfqq()
5076 bfqq->last_wr_start_finish = jiffies; in bfq_init_bfqq()
5077 bfqq->wr_start_at_switch_to_srt = bfq_smallest_from_now(); in bfq_init_bfqq()
5078 bfqq->split_time = bfq_smallest_from_now(); in bfq_init_bfqq()
5089 bfqq->soft_rt_next_start = jiffies; in bfq_init_bfqq()
5092 bfqq->seek_history = 1; in bfq_init_bfqq()
5121 struct bfq_queue *bfqq; in bfq_get_queue() local
5128 bfqq = &bfqd->oom_bfqq; in bfq_get_queue()
5135 bfqq = *async_bfqq; in bfq_get_queue()
5136 if (bfqq) in bfq_get_queue()
5140 bfqq = kmem_cache_alloc_node(bfq_pool, in bfq_get_queue()
5144 if (bfqq) { in bfq_get_queue()
5145 bfq_init_bfqq(bfqd, bfqq, bic, current->pid, in bfq_get_queue()
5147 bfq_init_entity(&bfqq->entity, bfqg); in bfq_get_queue()
5148 bfq_log_bfqq(bfqd, bfqq, "allocated"); in bfq_get_queue()
5150 bfqq = &bfqd->oom_bfqq; in bfq_get_queue()
5151 bfq_log_bfqq(bfqd, bfqq, "using oom bfqq"); in bfq_get_queue()
5160 bfqq->ref++; /* in bfq_get_queue()
5167 bfq_log_bfqq(bfqd, bfqq, "get_queue, bfqq not in async: %p, %d", in bfq_get_queue()
5168 bfqq, bfqq->ref); in bfq_get_queue()
5169 *async_bfqq = bfqq; in bfq_get_queue()
5173 bfqq->ref++; /* get a process reference to this queue */ in bfq_get_queue()
5174 bfq_log_bfqq(bfqd, bfqq, "get_queue, at end: %p, %d", bfqq, bfqq->ref); in bfq_get_queue()
5176 return bfqq; in bfq_get_queue()
5180 struct bfq_queue *bfqq) in bfq_update_io_thinktime() argument
5182 struct bfq_ttime *ttime = &bfqq->ttime; in bfq_update_io_thinktime()
5183 u64 elapsed = ktime_get_ns() - bfqq->ttime.last_end_request; in bfq_update_io_thinktime()
5187 ttime->ttime_samples = (7*bfqq->ttime.ttime_samples + 256) / 8; in bfq_update_io_thinktime()
5194 bfq_update_io_seektime(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_update_io_seektime() argument
5197 bfqq->seek_history <<= 1; in bfq_update_io_seektime()
5198 bfqq->seek_history |= BFQ_RQ_SEEKY(bfqd, bfqq->last_request_pos, rq); in bfq_update_io_seektime()
5200 if (bfqq->wr_coeff > 1 && in bfq_update_io_seektime()
5201 bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time && in bfq_update_io_seektime()
5202 BFQQ_TOTALLY_SEEKY(bfqq)) in bfq_update_io_seektime()
5203 bfq_bfqq_end_wr(bfqq); in bfq_update_io_seektime()
5207 struct bfq_queue *bfqq, in bfq_update_has_short_ttime() argument
5217 if (!bfq_bfqq_sync(bfqq) || bfq_class_idle(bfqq) || in bfq_update_has_short_ttime()
5222 if (time_is_after_eq_jiffies(bfqq->split_time + in bfq_update_has_short_ttime()
5231 (bfq_sample_valid(bfqq->ttime.ttime_samples) && in bfq_update_has_short_ttime()
5232 bfqq->ttime.ttime_mean > bfqd->bfq_slice_idle)) in bfq_update_has_short_ttime()
5235 state_changed = has_short_ttime != bfq_bfqq_has_short_ttime(bfqq); in bfq_update_has_short_ttime()
5238 bfq_mark_bfqq_has_short_ttime(bfqq); in bfq_update_has_short_ttime()
5240 bfq_clear_bfqq_has_short_ttime(bfqq); in bfq_update_has_short_ttime()
5326 if (state_changed && bfqq->last_serv_time_ns == 0 && in bfq_update_has_short_ttime()
5327 (time_is_before_eq_jiffies(bfqq->decrease_time_jif + in bfq_update_has_short_ttime()
5330 bfq_reset_inject_limit(bfqd, bfqq); in bfq_update_has_short_ttime()
5337 static void bfq_rq_enqueued(struct bfq_data *bfqd, struct bfq_queue *bfqq, in bfq_rq_enqueued() argument
5341 bfqq->meta_pending++; in bfq_rq_enqueued()
5343 bfqq->last_request_pos = blk_rq_pos(rq) + blk_rq_sectors(rq); in bfq_rq_enqueued()
5345 if (bfqq == bfqd->in_service_queue && bfq_bfqq_wait_request(bfqq)) { in bfq_rq_enqueued()
5346 bool small_req = bfqq->queued[rq_is_sync(rq)] == 1 && in bfq_rq_enqueued()
5348 bool budget_timeout = bfq_bfqq_budget_timeout(bfqq); in bfq_rq_enqueued()
5366 if (small_req && idling_boosts_thr_without_issues(bfqd, bfqq) && in bfq_rq_enqueued()
5377 bfq_clear_bfqq_wait_request(bfqq); in bfq_rq_enqueued()
5388 bfq_bfqq_expire(bfqd, bfqq, false, in bfq_rq_enqueued()
5396 struct bfq_queue *bfqq = RQ_BFQQ(rq), in __bfq_insert_request() local
5397 *new_bfqq = bfq_setup_cooperator(bfqd, bfqq, rq, true); in __bfq_insert_request()
5406 bfqq->allocated--; in __bfq_insert_request()
5416 if (bic_to_bfqq(RQ_BIC(rq), 1) == bfqq) in __bfq_insert_request()
5418 bfqq, new_bfqq); in __bfq_insert_request()
5420 bfq_clear_bfqq_just_created(bfqq); in __bfq_insert_request()
5425 bfq_put_queue(bfqq); in __bfq_insert_request()
5427 bfqq = new_bfqq; in __bfq_insert_request()
5430 bfq_update_io_thinktime(bfqd, bfqq); in __bfq_insert_request()
5431 bfq_update_has_short_ttime(bfqd, bfqq, RQ_BIC(rq)); in __bfq_insert_request()
5432 bfq_update_io_seektime(bfqd, bfqq, rq); in __bfq_insert_request()
5434 waiting = bfqq && bfq_bfqq_wait_request(bfqq); in __bfq_insert_request()
5436 idle_timer_disabled = waiting && !bfq_bfqq_wait_request(bfqq); in __bfq_insert_request()
5439 list_add_tail(&rq->queuelist, &bfqq->fifo); in __bfq_insert_request()
5441 bfq_rq_enqueued(bfqd, bfqq, rq); in __bfq_insert_request()
5448 struct bfq_queue *bfqq, in bfq_update_insert_stats() argument
5452 if (!bfqq) in bfq_update_insert_stats()
5466 bfqg_stats_update_io_add(bfqq_group(bfqq), bfqq, cmd_flags); in bfq_update_insert_stats()
5468 bfqg_stats_update_idle_time(bfqq_group(bfqq)); in bfq_update_insert_stats()
5473 struct bfq_queue *bfqq, in bfq_update_insert_stats() argument
5483 struct bfq_queue *bfqq; in bfq_insert_request() local
5498 bfqq = bfq_init_rq(rq); in bfq_insert_request()
5499 if (!bfqq || at_head || blk_rq_is_passthrough(rq)) { in bfq_insert_request()
5511 bfqq = RQ_BFQQ(rq); in bfq_insert_request()
5529 bfq_update_insert_stats(q, bfqq, idle_timer_disabled, in bfq_insert_request()
5547 struct bfq_queue *bfqq = bfqd->in_service_queue; in bfq_update_hw_tag() local
5569 if (bfqq && bfq_bfqq_has_short_ttime(bfqq) && in bfq_update_hw_tag()
5570 bfqq->dispatched + bfqq->queued[0] + bfqq->queued[1] < in bfq_update_hw_tag()
5586 static void bfq_completed_request(struct bfq_queue *bfqq, struct bfq_data *bfqd) in bfq_completed_request() argument
5594 bfqq->dispatched--; in bfq_completed_request()
5596 if (!bfqq->dispatched && !bfq_bfqq_busy(bfqq)) { in bfq_completed_request()
5603 bfqq->budget_timeout = jiffies; in bfq_completed_request()
5605 bfq_weights_tree_remove(bfqd, bfqq); in bfq_completed_request()
5610 bfqq->ttime.last_end_request = now_ns; in bfq_completed_request()
5639 bfqd->last_completed_rq_bfqq = bfqq; in bfq_completed_request()
5652 if (bfq_bfqq_softrt_update(bfqq) && bfqq->dispatched == 0 && in bfq_completed_request()
5653 RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_completed_request()
5654 bfqq->wr_coeff != bfqd->bfq_wr_coeff) in bfq_completed_request()
5655 bfqq->soft_rt_next_start = in bfq_completed_request()
5656 bfq_bfqq_softrt_next_start(bfqd, bfqq); in bfq_completed_request()
5662 if (bfqd->in_service_queue == bfqq) { in bfq_completed_request()
5663 if (bfq_bfqq_must_idle(bfqq)) { in bfq_completed_request()
5664 if (bfqq->dispatched == 0) in bfq_completed_request()
5690 } else if (bfq_may_expire_for_budg_timeout(bfqq)) in bfq_completed_request()
5691 bfq_bfqq_expire(bfqd, bfqq, false, in bfq_completed_request()
5693 else if (RB_EMPTY_ROOT(&bfqq->sort_list) && in bfq_completed_request()
5694 (bfqq->dispatched == 0 || in bfq_completed_request()
5695 !bfq_better_to_idle(bfqq))) in bfq_completed_request()
5696 bfq_bfqq_expire(bfqd, bfqq, false, in bfq_completed_request()
5704 static void bfq_finish_requeue_request_body(struct bfq_queue *bfqq) in bfq_finish_requeue_request_body() argument
5706 bfqq->allocated--; in bfq_finish_requeue_request_body()
5708 bfq_put_queue(bfqq); in bfq_finish_requeue_request_body()
5816 struct bfq_queue *bfqq) in bfq_update_inject_limit() argument
5819 unsigned int old_limit = bfqq->inject_limit; in bfq_update_inject_limit()
5821 if (bfqq->last_serv_time_ns > 0 && bfqd->rqs_injected) { in bfq_update_inject_limit()
5822 u64 threshold = (bfqq->last_serv_time_ns * 3)>>1; in bfq_update_inject_limit()
5825 bfqq->inject_limit--; in bfq_update_inject_limit()
5826 bfqq->decrease_time_jif = jiffies; in bfq_update_inject_limit()
5829 bfqq->inject_limit++; in bfq_update_inject_limit()
5844 if ((bfqq->last_serv_time_ns == 0 && bfqd->rq_in_driver == 1) || in bfq_update_inject_limit()
5845 tot_time_ns < bfqq->last_serv_time_ns) { in bfq_update_inject_limit()
5846 if (bfqq->last_serv_time_ns == 0) { in bfq_update_inject_limit()
5851 bfqq->inject_limit = max_t(unsigned int, 1, old_limit); in bfq_update_inject_limit()
5853 bfqq->last_serv_time_ns = tot_time_ns; in bfq_update_inject_limit()
5864 bfqq->last_serv_time_ns = tot_time_ns; in bfq_update_inject_limit()
5880 struct bfq_queue *bfqq = RQ_BFQQ(rq); in bfq_finish_requeue_request() local
5900 if (!rq->elv.icq || !bfqq) in bfq_finish_requeue_request()
5903 bfqd = bfqq->bfqd; in bfq_finish_requeue_request()
5906 bfqg_stats_update_completion(bfqq_group(bfqq), in bfq_finish_requeue_request()
5917 bfq_update_inject_limit(bfqd, bfqq); in bfq_finish_requeue_request()
5919 bfq_completed_request(bfqq, bfqd); in bfq_finish_requeue_request()
5920 bfq_finish_requeue_request_body(bfqq); in bfq_finish_requeue_request()
5939 bfqg_stats_update_io_remove(bfqq_group(bfqq), in bfq_finish_requeue_request()
5942 bfq_finish_requeue_request_body(bfqq); in bfq_finish_requeue_request()
5971 bfq_split_bfqq(struct bfq_io_cq *bic, struct bfq_queue *bfqq) in bfq_split_bfqq() argument
5973 bfq_log_bfqq(bfqq->bfqd, bfqq, "splitting queue"); in bfq_split_bfqq()
5975 if (bfqq_process_refs(bfqq) == 1) { in bfq_split_bfqq()
5976 bfqq->pid = current->pid; in bfq_split_bfqq()
5977 bfq_clear_bfqq_coop(bfqq); in bfq_split_bfqq()
5978 bfq_clear_bfqq_split_coop(bfqq); in bfq_split_bfqq()
5979 return bfqq; in bfq_split_bfqq()
5984 bfq_put_cooperator(bfqq); in bfq_split_bfqq()
5986 bfq_release_process_ref(bfqq->bfqd, bfqq); in bfq_split_bfqq()
5996 struct bfq_queue *bfqq = bic_to_bfqq(bic, is_sync); in bfq_get_bfqq_handle_split() local
5998 if (likely(bfqq && bfqq != &bfqd->oom_bfqq)) in bfq_get_bfqq_handle_split()
5999 return bfqq; in bfq_get_bfqq_handle_split()
6004 if (bfqq) in bfq_get_bfqq_handle_split()
6005 bfq_put_queue(bfqq); in bfq_get_bfqq_handle_split()
6006 bfqq = bfq_get_queue(bfqd, bio, is_sync, bic); in bfq_get_bfqq_handle_split()
6008 bic_set_bfqq(bic, bfqq, is_sync); in bfq_get_bfqq_handle_split()
6012 bfq_mark_bfqq_in_large_burst(bfqq); in bfq_get_bfqq_handle_split()
6014 bfq_clear_bfqq_in_large_burst(bfqq); in bfq_get_bfqq_handle_split()
6044 hlist_add_head(&bfqq->burst_list_node, in bfq_get_bfqq_handle_split()
6047 bfqq->split_time = jiffies; in bfq_get_bfqq_handle_split()
6050 return bfqq; in bfq_get_bfqq_handle_split()
6099 struct bfq_queue *bfqq; in bfq_init_rq() local
6122 bfqq = bfq_get_bfqq_handle_split(bfqd, bic, bio, false, is_sync, in bfq_init_rq()
6127 if (bfq_bfqq_coop(bfqq) && bfq_bfqq_split_coop(bfqq)) { in bfq_init_rq()
6128 bfq_log_bfqq(bfqd, bfqq, "breaking apart bfqq"); in bfq_init_rq()
6131 if (bfq_bfqq_in_large_burst(bfqq)) in bfq_init_rq()
6134 bfqq = bfq_split_bfqq(bic, bfqq); in bfq_init_rq()
6137 if (!bfqq) in bfq_init_rq()
6138 bfqq = bfq_get_bfqq_handle_split(bfqd, bic, bio, in bfq_init_rq()
6146 bfqq->allocated++; in bfq_init_rq()
6147 bfqq->ref++; in bfq_init_rq()
6148 bfq_log_bfqq(bfqd, bfqq, "get_request %p: bfqq %p, %d", in bfq_init_rq()
6149 rq, bfqq, bfqq->ref); in bfq_init_rq()
6152 rq->elv.priv[1] = bfqq; in bfq_init_rq()
6160 if (likely(bfqq != &bfqd->oom_bfqq) && bfqq_process_refs(bfqq) == 1) { in bfq_init_rq()
6161 bfqq->bic = bic; in bfq_init_rq()
6168 bfq_bfqq_resume_state(bfqq, bfqd, bic, in bfq_init_rq()
6193 if (unlikely(bfq_bfqq_just_created(bfqq) && in bfq_init_rq()
6196 bfq_handle_burst(bfqd, bfqq); in bfq_init_rq()
6198 return bfqq; in bfq_init_rq()
6201 static void bfq_idle_slice_timer_body(struct bfq_queue *bfqq) in bfq_idle_slice_timer_body() argument
6203 struct bfq_data *bfqd = bfqq->bfqd; in bfq_idle_slice_timer_body()
6208 bfq_clear_bfqq_wait_request(bfqq); in bfq_idle_slice_timer_body()
6210 if (bfqq != bfqd->in_service_queue) { in bfq_idle_slice_timer_body()
6215 if (bfq_bfqq_budget_timeout(bfqq)) in bfq_idle_slice_timer_body()
6222 else if (bfqq->queued[0] == 0 && bfqq->queued[1] == 0) in bfq_idle_slice_timer_body()
6233 bfq_bfqq_expire(bfqd, bfqq, true, reason); in bfq_idle_slice_timer_body()
6248 struct bfq_queue *bfqq = bfqd->in_service_queue; in bfq_idle_slice_timer() local
6258 if (bfqq) in bfq_idle_slice_timer()
6259 bfq_idle_slice_timer_body(bfqq); in bfq_idle_slice_timer()
6267 struct bfq_queue *bfqq = *bfqq_ptr; in __bfq_put_async_bfqq() local
6269 bfq_log(bfqd, "put_async_bfqq: %p", bfqq); in __bfq_put_async_bfqq()
6270 if (bfqq) { in __bfq_put_async_bfqq()
6271 bfq_bfqq_move(bfqd, bfqq, bfqd->root_group); in __bfq_put_async_bfqq()
6273 bfq_log_bfqq(bfqd, bfqq, "put_async_bfqq: putting %p, %d", in __bfq_put_async_bfqq()
6274 bfqq, bfqq->ref); in __bfq_put_async_bfqq()
6275 bfq_put_queue(bfqq); in __bfq_put_async_bfqq()
6363 struct bfq_queue *bfqq, *n; in bfq_exit_queue() local
6368 list_for_each_entry_safe(bfqq, n, &bfqd->idle_list, bfqq_list) in bfq_exit_queue()
6369 bfq_deactivate_bfqq(bfqd, bfqq, false, false); in bfq_exit_queue()