Home
last modified time | relevance | path

Searched refs:entity (Results 1 – 4 of 4) sorted by relevance

/block/
Dbfq-wf2q.c39 static unsigned int bfq_class_idx(struct bfq_entity *entity) in bfq_class_idx() argument
41 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_class_idx()
149 struct bfq_entity *group_entity = bfqq->entity.parent; in bfq_bfqq_to_bfqg()
152 group_entity = &bfqq->bfqd->root_group->entity; in bfq_bfqq_to_bfqg()
154 return container_of(group_entity, struct bfq_group, entity); in bfq_bfqq_to_bfqg()
206 static bool bfq_no_longer_next_in_service(struct bfq_entity *entity) in bfq_no_longer_next_in_service() argument
210 if (bfq_entity_to_bfqq(entity)) in bfq_no_longer_next_in_service()
213 bfqg = container_of(entity, struct bfq_group, entity); in bfq_no_longer_next_in_service()
245 static bool bfq_no_longer_next_in_service(struct bfq_entity *entity) in bfq_no_longer_next_in_service() argument
261 struct bfq_queue *bfq_entity_to_bfqq(struct bfq_entity *entity) in bfq_entity_to_bfqq() argument
[all …]
Dbfq-cgroup.c192 struct bfq_entity *group_entity = bfqq->entity.parent; in bfqq_group()
195 entity) : in bfqq_group()
324 void bfq_init_entity(struct bfq_entity *entity, struct bfq_group *bfqg) in bfq_init_entity() argument
326 struct bfq_queue *bfqq = bfq_entity_to_bfqq(entity); in bfq_init_entity()
328 entity->weight = entity->new_weight; in bfq_init_entity()
329 entity->orig_weight = entity->new_weight; in bfq_init_entity()
339 entity->parent = bfqg->my_entity; /* NULL for root group */ in bfq_init_entity()
340 entity->sched_data = &bfqg->sched_data; in bfq_init_entity()
434 struct bfq_entity *entity = &bfqg->entity; in bfq_pd_init() local
437 entity->orig_weight = entity->weight = entity->new_weight = d->weight; in bfq_pd_init()
[all …]
Dbfq-iosched.h267 struct bfq_entity entity; member
780 struct bfq_entity entity; member
808 struct bfq_queue *bfq_entity_to_bfqq(struct bfq_entity *entity);
821 void bfq_weights_tree_add(struct bfq_data *bfqd, struct bfq_entity *entity,
823 void bfq_weights_tree_remove(struct bfq_data *bfqd, struct bfq_entity *entity,
850 void bfq_init_entity(struct bfq_entity *entity, struct bfq_group *bfqg);
872 #define for_each_entity(entity) \ argument
873 for (; entity ; entity = entity->parent)
881 #define for_each_entity_safe(entity, parent) \ argument
882 for (; entity && ({ parent = entity->parent; 1; }); entity = parent)
[all …]
Dbfq-iosched.c536 void bfq_weights_tree_add(struct bfq_data *bfqd, struct bfq_entity *entity, in bfq_weights_tree_add() argument
554 if (entity->weight_counter) in bfq_weights_tree_add()
563 if (entity->weight == __counter->weight) { in bfq_weights_tree_add()
564 entity->weight_counter = __counter; in bfq_weights_tree_add()
567 if (entity->weight < __counter->weight) in bfq_weights_tree_add()
573 entity->weight_counter = kzalloc(sizeof(struct bfq_weight_counter), in bfq_weights_tree_add()
588 if (unlikely(!entity->weight_counter)) in bfq_weights_tree_add()
591 entity->weight_counter->weight = entity->weight; in bfq_weights_tree_add()
592 rb_link_node(&entity->weight_counter->weights_node, parent, new); in bfq_weights_tree_add()
593 rb_insert_color(&entity->weight_counter->weights_node, root); in bfq_weights_tree_add()
[all …]