38 unsigned int bfq_tot_busy_queues(struct bfq_data *bfqd)  in bfq_tot_busy_queues()  argument
40 	return bfqd->busy_queues[0] + bfqd->busy_queues[1] +  in bfq_tot_busy_queues()
41 		bfqd->busy_queues[2];  in bfq_tot_busy_queues()
153 		group_entity = &bfqq->bfqd->root_group->entity;  in bfq_bfqq_to_bfqg()
238 	return bfqq->bfqd->root_group;  in bfq_bfqq_to_bfqg()
296 		bfq_log_bfqq(bfqq->bfqd, bfqq,  in bfq_calc_finish()
299 		bfq_log_bfqq(bfqq->bfqd, bfqq,  in bfq_calc_finish()
480 	struct bfq_data *bfqd = NULL;  in bfq_active_insert()  local
495 	bfqd = (struct bfq_data *)bfqg->bfqd;  in bfq_active_insert()
498 		list_add(&bfqq->bfqq_list, &bfqq->bfqd->active_list);  in bfq_active_insert()
500 	if (bfqg != bfqd->root_group)  in bfq_active_insert()
534 		bfq_log_bfqq(bfqq->bfqd, bfqq, "get_entity: %p %d",  in bfq_get_entity()
582 	struct bfq_data *bfqd = NULL;  in bfq_active_extract()  local
594 	bfqd = (struct bfq_data *)bfqg->bfqd;  in bfq_active_extract()
599 	if (bfqg != bfqd->root_group)  in bfq_active_extract()
624 		list_add(&bfqq->bfqq_list, &bfqq->bfqd->idle_list);  in bfq_idle_insert()
727 		struct bfq_data *bfqd = NULL;  in __bfq_entity_update_weight_prio()  local
735 			bfqd = bfqq->bfqd;  in __bfq_entity_update_weight_prio()
740 			bfqd = (struct bfq_data *)bfqg->bfqd;  in __bfq_entity_update_weight_prio()
792 			root = &bfqd->queue_weights_tree;  in __bfq_entity_update_weight_prio()
793 			__bfq_weights_tree_remove(bfqd, bfqq, root);  in __bfq_entity_update_weight_prio()
802 			bfq_weights_tree_add(bfqd, bfqq, root);  in __bfq_entity_update_weight_prio()
844 	bfq_log_bfqq(bfqq->bfqd, bfqq, "bfqq_served %d secs", served);  in bfq_bfqq_served()
874 void bfq_bfqq_charge_time(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_bfqq_charge_time()  argument
881 		(bfqd->bfq_max_budget * bounded_time_ms) / timeout_ms;  in bfq_bfqq_charge_time()
1009 		struct bfq_data *bfqd = bfqg->bfqd;  in __bfq_activate_entity()  local
1013 			bfqd->num_groups_with_pending_reqs++;  in __bfq_activate_entity()
1499 bool next_queue_may_preempt(struct bfq_data *bfqd)  in next_queue_may_preempt()  argument
1501 	struct bfq_sched_data *sd = &bfqd->root_group->sched_data;  in next_queue_may_preempt()
1509 struct bfq_queue *bfq_get_next_queue(struct bfq_data *bfqd)  in bfq_get_next_queue()  argument
1515 	if (bfq_tot_busy_queues(bfqd) == 0)  in bfq_get_next_queue()
1523 	sd = &bfqd->root_group->sched_data;  in bfq_get_next_queue()
1602 bool __bfq_bfqd_reset_in_service(struct bfq_data *bfqd)  in __bfq_bfqd_reset_in_service()  argument
1604 	struct bfq_queue *in_serv_bfqq = bfqd->in_service_queue;  in __bfq_bfqd_reset_in_service()
1609 	hrtimer_try_to_cancel(&bfqd->idle_slice_timer);  in __bfq_bfqd_reset_in_service()
1610 	bfqd->in_service_queue = NULL;  in __bfq_bfqd_reset_in_service()
1642 void bfq_deactivate_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_deactivate_bfqq()  argument
1650 void bfq_activate_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq)  in bfq_activate_bfqq()  argument
1659 void bfq_requeue_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_requeue_bfqq()  argument
1665 				    bfqq == bfqd->in_service_queue, expiration);  in bfq_requeue_bfqq()
1673 void bfq_del_bfqq_busy(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_del_bfqq_busy()  argument
1676 	bfq_log_bfqq(bfqd, bfqq, "del from busy");  in bfq_del_bfqq_busy()
1680 	bfqd->busy_queues[bfqq->ioprio_class - 1]--;  in bfq_del_bfqq_busy()
1683 		bfqd->wr_busy_queues--;  in bfq_del_bfqq_busy()
1687 	bfq_deactivate_bfqq(bfqd, bfqq, true, expiration);  in bfq_del_bfqq_busy()
1690 		bfq_weights_tree_remove(bfqd, bfqq);  in bfq_del_bfqq_busy()
1696 void bfq_add_bfqq_busy(struct bfq_data *bfqd, struct bfq_queue *bfqq)  in bfq_add_bfqq_busy()  argument
1698 	bfq_log_bfqq(bfqd, bfqq, "add to busy");  in bfq_add_bfqq_busy()
1700 	bfq_activate_bfqq(bfqd, bfqq);  in bfq_add_bfqq_busy()
1703 	bfqd->busy_queues[bfqq->ioprio_class - 1]++;  in bfq_add_bfqq_busy()
1707 			bfq_weights_tree_add(bfqd, bfqq,  in bfq_add_bfqq_busy()
1708 					     &bfqd->queue_weights_tree);  in bfq_add_bfqq_busy()
1711 		bfqd->wr_busy_queues++;  in bfq_add_bfqq_busy()