Lines Matching refs:entity
30 static unsigned int bfq_class_idx(struct bfq_entity *entity) in bfq_class_idx() argument
32 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_class_idx()
147 struct bfq_entity *group_entity = bfqq->entity.parent; in bfq_bfqq_to_bfqg()
150 group_entity = &bfqq->bfqd->root_group->entity; in bfq_bfqq_to_bfqg()
152 return container_of(group_entity, struct bfq_group, entity); in bfq_bfqq_to_bfqg()
204 static bool bfq_no_longer_next_in_service(struct bfq_entity *entity) in bfq_no_longer_next_in_service() argument
208 if (bfq_entity_to_bfqq(entity)) in bfq_no_longer_next_in_service()
211 bfqg = container_of(entity, struct bfq_group, entity); in bfq_no_longer_next_in_service()
243 static bool bfq_no_longer_next_in_service(struct bfq_entity *entity) in bfq_no_longer_next_in_service() argument
259 struct bfq_queue *bfq_entity_to_bfqq(struct bfq_entity *entity) in bfq_entity_to_bfqq() argument
263 if (!entity->my_sched_data) in bfq_entity_to_bfqq()
264 bfqq = container_of(entity, struct bfq_queue, entity); in bfq_entity_to_bfqq()
285 static void bfq_calc_finish(struct bfq_entity *entity, unsigned long service) in bfq_calc_finish() argument
287 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_calc_finish()
289 entity->finish = entity->start + in bfq_calc_finish()
290 bfq_delta(service, entity->weight); in bfq_calc_finish()
295 service, entity->weight); in bfq_calc_finish()
298 entity->start, entity->finish, in bfq_calc_finish()
299 bfq_delta(service, entity->weight)); in bfq_calc_finish()
314 struct bfq_entity *entity = NULL; in bfq_entity_of() local
317 entity = rb_entry(node, struct bfq_entity, rb_node); in bfq_entity_of()
319 return entity; in bfq_entity_of()
327 static void bfq_extract(struct rb_root *root, struct bfq_entity *entity) in bfq_extract() argument
329 entity->tree = NULL; in bfq_extract()
330 rb_erase(&entity->rb_node, root); in bfq_extract()
339 struct bfq_entity *entity) in bfq_idle_extract() argument
341 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_idle_extract()
344 if (entity == st->first_idle) { in bfq_idle_extract()
345 next = rb_next(&entity->rb_node); in bfq_idle_extract()
349 if (entity == st->last_idle) { in bfq_idle_extract()
350 next = rb_prev(&entity->rb_node); in bfq_idle_extract()
354 bfq_extract(&st->idle, entity); in bfq_idle_extract()
368 static void bfq_insert(struct rb_root *root, struct bfq_entity *entity) in bfq_insert() argument
378 if (bfq_gt(entry->finish, entity->finish)) in bfq_insert()
384 rb_link_node(&entity->rb_node, parent, node); in bfq_insert()
385 rb_insert_color(&entity->rb_node, root); in bfq_insert()
387 entity->tree = root; in bfq_insert()
400 static void bfq_update_min(struct bfq_entity *entity, struct rb_node *node) in bfq_update_min() argument
406 if (bfq_gt(entity->min_start, child->min_start)) in bfq_update_min()
407 entity->min_start = child->min_start; in bfq_update_min()
421 struct bfq_entity *entity = rb_entry(node, struct bfq_entity, rb_node); in bfq_update_active_node() local
423 entity->min_start = entity->start; in bfq_update_active_node()
424 bfq_update_min(entity, node->rb_right); in bfq_update_active_node()
425 bfq_update_min(entity, node->rb_left); in bfq_update_active_node()
470 struct bfq_entity *entity) in bfq_active_insert() argument
472 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_active_insert()
473 struct rb_node *node = &entity->rb_node; in bfq_active_insert()
480 bfq_insert(&st->active, entity); in bfq_active_insert()
490 sd = entity->sched_data; in bfq_active_insert()
525 static void bfq_get_entity(struct bfq_entity *entity) in bfq_get_entity() argument
527 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_get_entity()
572 struct bfq_entity *entity) in bfq_active_extract() argument
574 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_active_extract()
582 node = bfq_find_deepest(&entity->rb_node); in bfq_active_extract()
583 bfq_extract(&st->active, entity); in bfq_active_extract()
589 sd = entity->sched_data; in bfq_active_extract()
607 struct bfq_entity *entity) in bfq_idle_insert() argument
609 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_idle_insert()
613 if (!first_idle || bfq_gt(first_idle->finish, entity->finish)) in bfq_idle_insert()
614 st->first_idle = entity; in bfq_idle_insert()
615 if (!last_idle || bfq_gt(entity->finish, last_idle->finish)) in bfq_idle_insert()
616 st->last_idle = entity; in bfq_idle_insert()
618 bfq_insert(&st->idle, entity); in bfq_idle_insert()
640 struct bfq_entity *entity, in bfq_forget_entity() argument
643 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_forget_entity()
645 entity->on_st_or_in_serv = false; in bfq_forget_entity()
646 st->wsum -= entity->weight; in bfq_forget_entity()
656 void bfq_put_idle_entity(struct bfq_service_tree *st, struct bfq_entity *entity) in bfq_put_idle_entity() argument
658 bfq_idle_extract(st, entity); in bfq_put_idle_entity()
659 bfq_forget_entity(st, entity, in bfq_put_idle_entity()
660 entity == entity->sched_data->in_service_entity); in bfq_put_idle_entity()
688 struct bfq_service_tree *bfq_entity_service_tree(struct bfq_entity *entity) in bfq_entity_service_tree() argument
690 struct bfq_sched_data *sched_data = entity->sched_data; in bfq_entity_service_tree()
691 unsigned int idx = bfq_class_idx(entity); in bfq_entity_service_tree()
716 struct bfq_entity *entity, in __bfq_entity_update_weight_prio() argument
721 if (entity->prio_changed) { in __bfq_entity_update_weight_prio()
722 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in __bfq_entity_update_weight_prio()
735 sd = entity->my_sched_data; in __bfq_entity_update_weight_prio()
743 old_st->wsum -= entity->weight; in __bfq_entity_update_weight_prio()
745 if (entity->new_weight != entity->orig_weight) { in __bfq_entity_update_weight_prio()
746 if (entity->new_weight < BFQ_MIN_WEIGHT || in __bfq_entity_update_weight_prio()
747 entity->new_weight > BFQ_MAX_WEIGHT) { in __bfq_entity_update_weight_prio()
749 entity->new_weight); in __bfq_entity_update_weight_prio()
750 if (entity->new_weight < BFQ_MIN_WEIGHT) in __bfq_entity_update_weight_prio()
751 entity->new_weight = BFQ_MIN_WEIGHT; in __bfq_entity_update_weight_prio()
753 entity->new_weight = BFQ_MAX_WEIGHT; in __bfq_entity_update_weight_prio()
755 entity->orig_weight = entity->new_weight; in __bfq_entity_update_weight_prio()
758 bfq_weight_to_ioprio(entity->orig_weight); in __bfq_entity_update_weight_prio()
769 entity->prio_changed = 0; in __bfq_entity_update_weight_prio()
778 new_st = bfq_entity_service_tree(entity); in __bfq_entity_update_weight_prio()
780 prev_weight = entity->weight; in __bfq_entity_update_weight_prio()
781 new_weight = entity->orig_weight * in __bfq_entity_update_weight_prio()
792 entity->weight = new_weight; in __bfq_entity_update_weight_prio()
802 new_st->wsum += entity->weight; in __bfq_entity_update_weight_prio()
805 entity->start = new_st->vtime; in __bfq_entity_update_weight_prio()
823 struct bfq_entity *entity = &bfqq->entity; in bfq_bfqq_served() local
833 for_each_entity(entity) { in bfq_bfqq_served()
834 st = bfq_entity_service_tree(entity); in bfq_bfqq_served()
836 entity->service += served; in bfq_bfqq_served()
874 struct bfq_entity *entity = &bfqq->entity; in bfq_bfqq_charge_time() local
879 int tot_serv_to_charge = max(serv_to_charge_for_time, entity->service); in bfq_bfqq_charge_time()
882 if (tot_serv_to_charge > entity->budget) in bfq_bfqq_charge_time()
883 entity->budget = tot_serv_to_charge; in bfq_bfqq_charge_time()
886 max_t(int, 0, tot_serv_to_charge - entity->service)); in bfq_bfqq_charge_time()
889 static void bfq_update_fin_time_enqueue(struct bfq_entity *entity, in bfq_update_fin_time_enqueue() argument
893 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_update_fin_time_enqueue()
900 st = __bfq_entity_update_weight_prio(st, entity, true); in bfq_update_fin_time_enqueue()
901 bfq_calc_finish(entity, entity->budget); in bfq_update_fin_time_enqueue()
936 if (backshifted && bfq_gt(st->vtime, entity->finish)) { in bfq_update_fin_time_enqueue()
937 unsigned long delta = st->vtime - entity->finish; in bfq_update_fin_time_enqueue()
942 entity->start += delta; in bfq_update_fin_time_enqueue()
943 entity->finish += delta; in bfq_update_fin_time_enqueue()
946 bfq_active_insert(st, entity); in bfq_update_fin_time_enqueue()
961 static void __bfq_activate_entity(struct bfq_entity *entity, in __bfq_activate_entity() argument
964 struct bfq_service_tree *st = bfq_entity_service_tree(entity); in __bfq_activate_entity()
969 if (non_blocking_wait_rq && bfq_gt(st->vtime, entity->finish)) { in __bfq_activate_entity()
971 min_vstart = entity->finish; in __bfq_activate_entity()
975 if (entity->tree == &st->idle) { in __bfq_activate_entity()
980 bfq_idle_extract(st, entity); in __bfq_activate_entity()
981 entity->start = bfq_gt(min_vstart, entity->finish) ? in __bfq_activate_entity()
982 min_vstart : entity->finish; in __bfq_activate_entity()
989 entity->start = min_vstart; in __bfq_activate_entity()
990 st->wsum += entity->weight; in __bfq_activate_entity()
997 bfq_get_entity(entity); in __bfq_activate_entity()
999 entity->on_st_or_in_serv = true; in __bfq_activate_entity()
1003 if (!bfq_entity_to_bfqq(entity)) { /* bfq_group */ in __bfq_activate_entity()
1005 container_of(entity, struct bfq_group, entity); in __bfq_activate_entity()
1008 if (!entity->in_groups_with_pending_reqs) { in __bfq_activate_entity()
1009 entity->in_groups_with_pending_reqs = true; in __bfq_activate_entity()
1015 bfq_update_fin_time_enqueue(entity, st, backshifted); in __bfq_activate_entity()
1033 static void __bfq_requeue_entity(struct bfq_entity *entity) in __bfq_requeue_entity() argument
1035 struct bfq_sched_data *sd = entity->sched_data; in __bfq_requeue_entity()
1036 struct bfq_service_tree *st = bfq_entity_service_tree(entity); in __bfq_requeue_entity()
1038 if (entity == sd->in_service_entity) { in __bfq_requeue_entity()
1061 bfq_calc_finish(entity, entity->service); in __bfq_requeue_entity()
1062 entity->start = entity->finish; in __bfq_requeue_entity()
1076 if (entity->tree) in __bfq_requeue_entity()
1077 bfq_active_extract(st, entity); in __bfq_requeue_entity()
1093 bfq_active_extract(st, entity); in __bfq_requeue_entity()
1096 bfq_update_fin_time_enqueue(entity, st, false); in __bfq_requeue_entity()
1099 static void __bfq_activate_requeue_entity(struct bfq_entity *entity, in __bfq_activate_requeue_entity() argument
1103 struct bfq_service_tree *st = bfq_entity_service_tree(entity); in __bfq_activate_requeue_entity()
1105 if (sd->in_service_entity == entity || entity->tree == &st->active) in __bfq_activate_requeue_entity()
1110 __bfq_requeue_entity(entity); in __bfq_activate_requeue_entity()
1116 __bfq_activate_entity(entity, non_blocking_wait_rq); in __bfq_activate_requeue_entity()
1133 static void bfq_activate_requeue_entity(struct bfq_entity *entity, in bfq_activate_requeue_entity() argument
1139 for_each_entity(entity) { in bfq_activate_requeue_entity()
1140 sd = entity->sched_data; in bfq_activate_requeue_entity()
1141 __bfq_activate_requeue_entity(entity, sd, non_blocking_wait_rq); in bfq_activate_requeue_entity()
1143 if (!bfq_update_next_in_service(sd, entity, expiration) && in bfq_activate_requeue_entity()
1159 bool __bfq_deactivate_entity(struct bfq_entity *entity, bool ins_into_idle_tree) in __bfq_deactivate_entity() argument
1161 struct bfq_sched_data *sd = entity->sched_data; in __bfq_deactivate_entity()
1165 if (!entity->on_st_or_in_serv) /* in __bfq_deactivate_entity()
1177 st = bfq_entity_service_tree(entity); in __bfq_deactivate_entity()
1178 is_in_service = entity == sd->in_service_entity; in __bfq_deactivate_entity()
1180 bfq_calc_finish(entity, entity->service); in __bfq_deactivate_entity()
1190 entity->service = 0; in __bfq_deactivate_entity()
1192 if (entity->tree == &st->active) in __bfq_deactivate_entity()
1193 bfq_active_extract(st, entity); in __bfq_deactivate_entity()
1194 else if (!is_in_service && entity->tree == &st->idle) in __bfq_deactivate_entity()
1195 bfq_idle_extract(st, entity); in __bfq_deactivate_entity()
1197 if (!ins_into_idle_tree || !bfq_gt(entity->finish, st->vtime)) in __bfq_deactivate_entity()
1198 bfq_forget_entity(st, entity, is_in_service); in __bfq_deactivate_entity()
1200 bfq_idle_insert(st, entity); in __bfq_deactivate_entity()
1212 static void bfq_deactivate_entity(struct bfq_entity *entity, in bfq_deactivate_entity() argument
1219 for_each_entity_safe(entity, parent) { in bfq_deactivate_entity()
1220 sd = entity->sched_data; in bfq_deactivate_entity()
1222 if (!__bfq_deactivate_entity(entity, ins_into_idle_tree)) { in bfq_deactivate_entity()
1233 if (sd->next_in_service == entity) in bfq_deactivate_entity()
1287 entity = parent; in bfq_deactivate_entity()
1288 for_each_entity(entity) { in bfq_deactivate_entity()
1295 __bfq_requeue_entity(entity); in bfq_deactivate_entity()
1297 sd = entity->sched_data; in bfq_deactivate_entity()
1298 if (!bfq_update_next_in_service(sd, entity, expiration) && in bfq_deactivate_entity()
1400 struct bfq_entity *entity; in __bfq_lookup_next_entity() local
1425 entity = bfq_first_active_entity(st, new_vtime); in __bfq_lookup_next_entity()
1427 return entity; in __bfq_lookup_next_entity()
1444 struct bfq_entity *entity = NULL; in bfq_lookup_next_entity() local
1482 entity = __bfq_lookup_next_entity(st + class_idx, in bfq_lookup_next_entity()
1486 if (entity) in bfq_lookup_next_entity()
1490 if (!entity) in bfq_lookup_next_entity()
1493 return entity; in bfq_lookup_next_entity()
1508 struct bfq_entity *entity = NULL; in bfq_get_next_queue() local
1521 for (; sd ; sd = entity->my_sched_data) { in bfq_get_next_queue()
1547 entity = sd->next_in_service; in bfq_get_next_queue()
1548 sd->in_service_entity = entity; in bfq_get_next_queue()
1558 if (bfq_no_longer_next_in_service(entity)) in bfq_get_next_queue()
1559 bfq_active_extract(bfq_entity_service_tree(entity), in bfq_get_next_queue()
1560 entity); in bfq_get_next_queue()
1582 bfqq = bfq_entity_to_bfqq(entity); in bfq_get_next_queue()
1588 for_each_entity(entity) { in bfq_get_next_queue()
1589 struct bfq_sched_data *sd = entity->sched_data; in bfq_get_next_queue()
1602 struct bfq_entity *in_serv_entity = &in_serv_bfqq->entity; in __bfq_bfqd_reset_in_service()
1603 struct bfq_entity *entity = in_serv_entity; in __bfq_bfqd_reset_in_service() local
1615 for_each_entity(entity) in __bfq_bfqd_reset_in_service()
1616 entity->sched_data->in_service_entity = NULL; in __bfq_bfqd_reset_in_service()
1642 struct bfq_entity *entity = &bfqq->entity; in bfq_deactivate_bfqq() local
1644 bfq_deactivate_entity(entity, ins_into_idle_tree, expiration); in bfq_deactivate_bfqq()
1649 struct bfq_entity *entity = &bfqq->entity; in bfq_activate_bfqq() local
1651 bfq_activate_requeue_entity(entity, bfq_bfqq_non_blocking_wait_rq(bfqq), in bfq_activate_bfqq()
1659 struct bfq_entity *entity = &bfqq->entity; in bfq_requeue_bfqq() local
1661 bfq_activate_requeue_entity(entity, false, in bfq_requeue_bfqq()