32 	struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity);  in bfq_class_idx()  local
34 	return bfqq ? bfqq->ioprio_class - 1 :  in bfq_class_idx()
246 	struct bfq_queue *bfqq = NULL;  in bfq_entity_to_bfqq()  local
249 		bfqq = container_of(entity, struct bfq_queue, entity);  in bfq_entity_to_bfqq()
251 	return bfqq;  in bfq_entity_to_bfqq()
272 	struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity);  in bfq_calc_finish()  local
277 	if (bfqq) {  in bfq_calc_finish()
278 		bfq_log_bfqq(bfqq->bfqd, bfqq,  in bfq_calc_finish()
281 		bfq_log_bfqq(bfqq->bfqd, bfqq,  in bfq_calc_finish()
326 	struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity);  in bfq_idle_extract()  local
341 	if (bfqq)  in bfq_idle_extract()
342 		list_del(&bfqq->bfqq_list);  in bfq_idle_extract()
457 	struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity);  in bfq_active_insert()  local
479 	if (bfqq)  in bfq_active_insert()
480 		list_add(&bfqq->bfqq_list, &bfqq->bfqd->active_list);  in bfq_active_insert()
512 	struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity);  in bfq_get_entity()  local
514 	if (bfqq) {  in bfq_get_entity()
515 		bfqq->ref++;  in bfq_get_entity()
516 		bfq_log_bfqq(bfqq->bfqd, bfqq, "get_entity: %p %d",  in bfq_get_entity()
517 			     bfqq, bfqq->ref);  in bfq_get_entity()
559 	struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity);  in bfq_active_extract()  local
578 	if (bfqq)  in bfq_active_extract()
579 		list_del(&bfqq->bfqq_list);  in bfq_active_extract()
594 	struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity);  in bfq_idle_insert()  local
605 	if (bfqq)  in bfq_idle_insert()
606 		list_add(&bfqq->bfqq_list, &bfqq->bfqd->idle_list);  in bfq_idle_insert()
628 	struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity);  in bfq_forget_entity()  local
632 	if (bfqq && !is_in_service)  in bfq_forget_entity()
633 		bfq_put_queue(bfqq);  in bfq_forget_entity()
707 		struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity);  in __bfq_entity_update_weight_prio()  local
716 		if (bfqq)  in __bfq_entity_update_weight_prio()
717 			bfqd = bfqq->bfqd;  in __bfq_entity_update_weight_prio()
741 			if (bfqq)  in __bfq_entity_update_weight_prio()
742 				bfqq->ioprio =  in __bfq_entity_update_weight_prio()
746 		if (bfqq && update_class_too)  in __bfq_entity_update_weight_prio()
747 			bfqq->ioprio_class = bfqq->new_ioprio_class;  in __bfq_entity_update_weight_prio()
753 		if (!bfqq || bfqq->ioprio_class == bfqq->new_ioprio_class)  in __bfq_entity_update_weight_prio()
767 			     (bfqq ? bfqq->wr_coeff : 1);  in __bfq_entity_update_weight_prio()
773 		if (prev_weight != new_weight && bfqq) {  in __bfq_entity_update_weight_prio()
775 			__bfq_weights_tree_remove(bfqd, bfqq, root);  in __bfq_entity_update_weight_prio()
782 		if (prev_weight != new_weight && bfqq && bfqq->wr_coeff == 1) {  in __bfq_entity_update_weight_prio()
784 			bfq_weights_tree_add(bfqd, bfqq, root);  in __bfq_entity_update_weight_prio()
806 void bfq_bfqq_served(struct bfq_queue *bfqq, int served)  in bfq_bfqq_served()  argument
808 	struct bfq_entity *entity = &bfqq->entity;  in bfq_bfqq_served()
811 	if (!bfqq->service_from_backlogged)  in bfq_bfqq_served()
812 		bfqq->first_IO_time = jiffies;  in bfq_bfqq_served()
814 	if (bfqq->wr_coeff > 1)  in bfq_bfqq_served()
815 		bfqq->service_from_wr += served;  in bfq_bfqq_served()
817 	bfqq->service_from_backlogged += served;  in bfq_bfqq_served()
826 	bfq_log_bfqq(bfqq->bfqd, bfqq, "bfqq_served %d secs", served);  in bfq_bfqq_served()
856 void bfq_bfqq_charge_time(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_bfqq_charge_time()  argument
859 	struct bfq_entity *entity = &bfqq->entity;  in bfq_bfqq_charge_time()
870 	bfq_bfqq_served(bfqq,  in bfq_bfqq_charge_time()
878 	struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity);  in bfq_update_fin_time_enqueue()  local
924 		if (bfqq)  in bfq_update_fin_time_enqueue()
925 			delta /= bfqq->wr_coeff;  in bfq_update_fin_time_enqueue()
1494 	struct bfq_queue *bfqq;  in bfq_get_next_queue()  local
1566 	bfqq = bfq_entity_to_bfqq(entity);  in bfq_get_next_queue()
1579 	return bfqq;  in bfq_get_next_queue()
1623 void bfq_deactivate_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_deactivate_bfqq()  argument
1626 	struct bfq_entity *entity = &bfqq->entity;  in bfq_deactivate_bfqq()
1631 void bfq_activate_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq)  in bfq_activate_bfqq()  argument
1633 	struct bfq_entity *entity = &bfqq->entity;  in bfq_activate_bfqq()
1635 	bfq_activate_requeue_entity(entity, bfq_bfqq_non_blocking_wait_rq(bfqq),  in bfq_activate_bfqq()
1637 	bfq_clear_bfqq_non_blocking_wait_rq(bfqq);  in bfq_activate_bfqq()
1640 void bfq_requeue_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_requeue_bfqq()  argument
1643 	struct bfq_entity *entity = &bfqq->entity;  in bfq_requeue_bfqq()
1646 				    bfqq == bfqd->in_service_queue, expiration);  in bfq_requeue_bfqq()
1654 void bfq_del_bfqq_busy(struct bfq_queue *bfqq, bool expiration)  in bfq_del_bfqq_busy()  argument
1656 	struct bfq_data *bfqd = bfqq->bfqd;  in bfq_del_bfqq_busy()
1658 	bfq_log_bfqq(bfqd, bfqq, "del from busy");  in bfq_del_bfqq_busy()
1660 	bfq_clear_bfqq_busy(bfqq);  in bfq_del_bfqq_busy()
1662 	bfqd->busy_queues[bfqq->ioprio_class - 1]--;  in bfq_del_bfqq_busy()
1664 	if (bfqq->wr_coeff > 1)  in bfq_del_bfqq_busy()
1667 	bfqg_stats_update_dequeue(bfqq_group(bfqq));  in bfq_del_bfqq_busy()
1669 	bfq_deactivate_bfqq(bfqd, bfqq, true, expiration);  in bfq_del_bfqq_busy()
1671 	if (!bfqq->dispatched)  in bfq_del_bfqq_busy()
1672 		bfq_weights_tree_remove(bfqd, bfqq);  in bfq_del_bfqq_busy()
1678 void bfq_add_bfqq_busy(struct bfq_queue *bfqq)  in bfq_add_bfqq_busy()  argument
1680 	struct bfq_data *bfqd = bfqq->bfqd;  in bfq_add_bfqq_busy()
1682 	bfq_log_bfqq(bfqd, bfqq, "add to busy");  in bfq_add_bfqq_busy()
1684 	bfq_activate_bfqq(bfqd, bfqq);  in bfq_add_bfqq_busy()
1686 	bfq_mark_bfqq_busy(bfqq);  in bfq_add_bfqq_busy()
1687 	bfqd->busy_queues[bfqq->ioprio_class - 1]++;  in bfq_add_bfqq_busy()
1689 	if (!bfqq->dispatched)  in bfq_add_bfqq_busy()
1690 		if (bfqq->wr_coeff == 1)  in bfq_add_bfqq_busy()
1691 			bfq_weights_tree_add(bfqd, bfqq,  in bfq_add_bfqq_busy()
1694 	if (bfqq->wr_coeff > 1)  in bfq_add_bfqq_busy()
1698 	if (!hlist_unhashed(&bfqq->woken_list_node) &&  in bfq_add_bfqq_busy()
1699 	    &bfqq->woken_list_node != bfqq->waker_bfqq->woken_list.first) {  in bfq_add_bfqq_busy()
1700 		hlist_del_init(&bfqq->woken_list_node);  in bfq_add_bfqq_busy()
1701 		hlist_add_head(&bfqq->woken_list_node,  in bfq_add_bfqq_busy()
1702 			       &bfqq->waker_bfqq->woken_list);  in bfq_add_bfqq_busy()