Lines Matching defs:entity

733 	struct bfq_entity *entity = &bfqq->entity;
758 if (entity->weight == __counter->weight) {
762 if (entity->weight < __counter->weight)
788 bfqq->weight_counter->weight = entity->weight;
825 * of active groups for each queue's inactive parent entity.
830 struct bfq_entity *entity = bfqq->entity.parent;
832 for_each_entity(entity) {
833 struct bfq_sched_data *sd = entity->my_sched_data;
837 * entity is still active, because either
853 * entity, but it is delayed to when it also happens
854 * that the first leaf descendant bfqq of entity gets
860 if (entity->in_groups_with_pending_reqs) {
861 entity->in_groups_with_pending_reqs = false;
950 struct bfq_entity *entity = &bfqq->entity;
960 * changed after an entity has been selected.
967 entity->service);
968 if (entity->budget != new_budget) {
969 entity->budget = new_budget;
1035 bfqq->entity.new_weight = bic->saved_weight;
1058 bfqq->entity.prio_changed = 1;
1071 return bfqq->ref - bfqq->allocated - bfqq->entity.on_st_or_in_serv -
1095 bfqd->burst_parent_entity = bfqq->entity.parent;
1283 bfqq->entity.parent != bfqd->burst_parent_entity) {
1319 struct bfq_entity *entity = &bfqq->entity;
1321 return entity->budget - entity->service;
1457 struct bfq_entity *entity = &bfqq->entity;
1477 * entity->service or entity->budget are not updated
1482 * entity->budget the remaining budget on such an
1485 entity->budget = min_t(unsigned long,
1490 * At this point, we have used entity->service to get
1492 * entity->budget). Thus we finally can, and have to,
1493 * reset entity->service. The latter must be reset
1498 entity->service = 0;
1506 entity->service = 0;
1507 entity->budget = max_t(unsigned long, bfqq->max_budget,
1565 bfqq->entity.budget = min_t(unsigned long,
1566 bfqq->entity.budget,
1641 if (in_serv_bfqq->entity.parent == bfqq->entity.parent) {
1642 bfqq_weight = bfqq->entity.weight;
1643 in_serv_weight = in_serv_bfqq->entity.weight;
1645 if (bfqq->entity.parent)
1646 bfqq_weight = bfqq->entity.parent->weight;
1648 bfqq_weight = bfqq->entity.weight;
1649 if (in_serv_bfqq->entity.parent)
1650 in_serv_weight = in_serv_bfqq->entity.parent->weight;
1652 in_serv_weight = in_serv_bfqq->entity.weight;
1755 bfqq->entity.prio_changed = 1;
2086 bfqq->entity.prio_changed = 1;
2189 * bfqq is empty, bfqq->entity.service and
2190 * bfqq->entity.budget must contain,
2196 * reset both bfqq->entity.service and
2197 * bfqq->entity.budget, if bfqq has still a
2200 bfqq->entity.budget = bfqq->entity.service = 0;
2387 bfqq->entity.prio_changed = 1;
2531 if (new_bfqq->entity.parent != bfqq->entity.parent)
2697 bfqq->entity.parent == in_service_bfqq->entity.parent &&
2730 bic->saved_weight = bfqq->entity.orig_weight;
2811 new_bfqq->entity.prio_changed = 1;
2816 bfqq->entity.prio_changed = 1;
2922 timeout_coeff = bfqq->entity.weight / bfqq->entity.orig_weight;
2977 bfqq->entity.budget);
3591 bfqq->entity.budget, bfq_bfqq_budget_left(bfqq));
3683 * quite precisely by bfqq->entity.service.
3685 * bfqq->entity.service is equal to the number
3691 budget = max_t(int, bfqq->entity.service, min_budget);
3724 bfqq->entity.budget = max_t(unsigned long, bfqq->max_budget,
3729 bfqq->entity.budget);
3812 slow = bfqq->entity.service < bfqd->bfq_max_budget / 2;
3956 struct bfq_entity *entity = &bfqq->entity;
3981 bfq_bfqq_budget_left(bfqq) >= entity->budget / 3)))
3985 entity->service <= 2 * entity->budget / 10)
4064 entity->service = 0;
4067 * Reset the received-service counter for every parent entity.
4068 * Differently from what happens with bfqq->entity.service,
4072 * consumed budget, bfqq->entity.service needs to be kept,
4074 * the same budget, the last value of bfqq->entity.service is
4075 * needed to properly decrement bfqq->entity.budget by the
4077 * to keep entity->service for parent entities too, because
4078 * the bubble up of the new value of bfqq->entity.budget will
4083 entity = entity->parent;
4084 for_each_entity(entity)
4085 entity->service = 0;
4111 bfq_bfqq_budget_left(bfqq) >= bfqq->entity.budget / 3,
4115 bfq_bfqq_budget_left(bfqq) >= bfqq->entity.budget / 3)
4580 struct bfq_entity *entity = &bfqq->entity;
4588 bfqq->entity.weight, bfqq->entity.orig_weight);
4590 if (entity->prio_changed)
4608 bfqq->entity.prio_changed = 1;
4621 * lowered. Since, entity may be on some active tree here, and
4626 if ((entity->weight > entity->orig_weight) != (bfqq->wr_coeff > 1))
4627 __bfq_entity_update_weight_prio(bfq_entity_service_tree(entity),
4628 entity, false);
5009 * Update the entity prio values; note that the new values will not
5056 bfqq->entity.new_weight = bfq_ioprio_to_weight(bfqq->new_ioprio);
5057 bfqq->entity.prio_changed = 1;
5096 RB_CLEAR_NODE(&bfqq->entity.rb_node);
5198 bfq_init_entity(&bfqq->entity, bfqg);
6429 root_group->entity.parent = NULL;
6468 bfqd->oom_bfqq.entity.new_weight =
6479 bfqd->oom_bfqq.entity.prio_changed = 1;
6560 bfq_init_entity(&bfqd->oom_bfqq.entity, bfqd->root_group);