156 		group_entity = &bfqq->bfqd->root_group->entity;  in bfq_bfqq_to_bfqg()
241 	return bfqq->bfqd->root_group;  in bfq_bfqq_to_bfqg()
302 		bfq_log_bfqq(bfqq->bfqd, bfqq,  in bfq_calc_finish()
305 		bfq_log_bfqq(bfqq->bfqd, bfqq,  in bfq_calc_finish()
486 	struct bfq_data *bfqd = NULL;  in bfq_active_insert()  local
501 	bfqd = (struct bfq_data *)bfqg->bfqd;  in bfq_active_insert()
504 		list_add(&bfqq->bfqq_list, &bfqq->bfqd->active_list);  in bfq_active_insert()
506 	if (bfqg != bfqd->root_group)  in bfq_active_insert()
540 		bfq_log_bfqq(bfqq->bfqd, bfqq, "get_entity: %p %d",  in bfq_get_entity()
588 	struct bfq_data *bfqd = NULL;  in bfq_active_extract()  local
600 	bfqd = (struct bfq_data *)bfqg->bfqd;  in bfq_active_extract()
605 	if (bfqg != bfqd->root_group)  in bfq_active_extract()
630 		list_add(&bfqq->bfqq_list, &bfqq->bfqd->idle_list);  in bfq_idle_insert()
733 		struct bfq_data *bfqd = NULL;  in __bfq_entity_update_weight_prio()  local
741 			bfqd = bfqq->bfqd;  in __bfq_entity_update_weight_prio()
746 			bfqd = (struct bfq_data *)bfqg->bfqd;  in __bfq_entity_update_weight_prio()
797 			root = bfqq ? &bfqd->queue_weights_tree :  in __bfq_entity_update_weight_prio()
798 				      &bfqd->group_weights_tree;  in __bfq_entity_update_weight_prio()
799 			__bfq_weights_tree_remove(bfqd, entity, root);  in __bfq_entity_update_weight_prio()
809 			bfq_weights_tree_add(bfqd, entity, root);  in __bfq_entity_update_weight_prio()
850 	bfq_log_bfqq(bfqq->bfqd, bfqq, "bfqq_served %d secs", served);  in bfq_bfqq_served()
880 void bfq_bfqq_charge_time(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_bfqq_charge_time()  argument
887 		(bfqd->bfq_max_budget * bounded_time_ms) / timeout_ms;  in bfq_bfqq_charge_time()
1016 		bfq_weights_tree_add(bfqg->bfqd, entity,  in __bfq_activate_entity()
1017 				     &bfqd->group_weights_tree);  in __bfq_activate_entity()
1493 bool next_queue_may_preempt(struct bfq_data *bfqd)  in next_queue_may_preempt()  argument
1495 	struct bfq_sched_data *sd = &bfqd->root_group->sched_data;  in next_queue_may_preempt()
1503 struct bfq_queue *bfq_get_next_queue(struct bfq_data *bfqd)  in bfq_get_next_queue()  argument
1509 	if (bfqd->busy_queues == 0)  in bfq_get_next_queue()
1517 	sd = &bfqd->root_group->sched_data;  in bfq_get_next_queue()
1595 void __bfq_bfqd_reset_in_service(struct bfq_data *bfqd)  in __bfq_bfqd_reset_in_service()  argument
1597 	struct bfq_queue *in_serv_bfqq = bfqd->in_service_queue;  in __bfq_bfqd_reset_in_service()
1602 	hrtimer_try_to_cancel(&bfqd->idle_slice_timer);  in __bfq_bfqd_reset_in_service()
1603 	bfqd->in_service_queue = NULL;  in __bfq_bfqd_reset_in_service()
1623 void bfq_deactivate_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_deactivate_bfqq()  argument
1631 void bfq_activate_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq)  in bfq_activate_bfqq()  argument
1640 void bfq_requeue_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_requeue_bfqq()  argument
1646 				    bfqq == bfqd->in_service_queue, expiration);  in bfq_requeue_bfqq()
1654 void bfq_del_bfqq_busy(struct bfq_data *bfqd, struct bfq_queue *bfqq,  in bfq_del_bfqq_busy()  argument
1657 	bfq_log_bfqq(bfqd, bfqq, "del from busy");  in bfq_del_bfqq_busy()
1661 	bfqd->busy_queues--;  in bfq_del_bfqq_busy()
1664 		bfq_weights_tree_remove(bfqd, bfqq);  in bfq_del_bfqq_busy()
1667 		bfqd->wr_busy_queues--;  in bfq_del_bfqq_busy()
1671 	bfq_deactivate_bfqq(bfqd, bfqq, true, expiration);  in bfq_del_bfqq_busy()
1677 void bfq_add_bfqq_busy(struct bfq_data *bfqd, struct bfq_queue *bfqq)  in bfq_add_bfqq_busy()  argument
1679 	bfq_log_bfqq(bfqd, bfqq, "add to busy");  in bfq_add_bfqq_busy()
1681 	bfq_activate_bfqq(bfqd, bfqq);  in bfq_add_bfqq_busy()
1684 	bfqd->busy_queues++;  in bfq_add_bfqq_busy()
1688 			bfq_weights_tree_add(bfqd, &bfqq->entity,  in bfq_add_bfqq_busy()
1689 					     &bfqd->queue_weights_tree);  in bfq_add_bfqq_busy()
1692 		bfqd->wr_busy_queues++;  in bfq_add_bfqq_busy()