Lines Matching refs:bfq_queue
127 * A bfq_entity is used to represent either a bfq_queue (leaf node in the
213 struct bfq_queue *last_bfqq_created;
234 * struct bfq_queue - leaf schedulable entity.
236 * A bfq_queue is a leaf request queue; it can be associated with an
239 * (an io_context is associated with a different bfq_queue for each
246 struct bfq_queue {
267 * Shared bfq_queue if queue is cooperating with one or more
270 struct bfq_queue *new_bfqq;
336 * Pointer to the bfq_io_cq owning the bfq_queue, set to %NULL
345 * enqueued after this time instant in an idle @bfq_queue with
360 * Time of the last transition of the @bfq_queue from idle to
365 * Cumulative service received from the @bfq_queue since the
370 * Cumulative service received from the @bfq_queue since its
392 struct bfq_queue *waker_bfqq;
394 struct bfq_queue *tentative_waker_bfqq;
469 struct bfq_queue *stable_merge_bfqq;
490 struct bfq_queue *bfqq[2][BFQ_MAX_ACTUATORS];
526 * weight-raised @bfq_queue (see the comments to the functions
621 /* bfq_queue in service */
622 struct bfq_queue *in_service_queue;
634 struct bfq_queue *last_completed_rq_bfqq;
637 struct bfq_queue *last_bfqq_created;
688 /* maximum budget allotted to a bfq_queue before rescheduling */
796 struct bfq_queue oom_bfqq;
810 struct bfq_queue *bio_bfqq;
848 * that the service of I/O from the in-service bfq_queue gets
885 void bfq_mark_bfqq_##name(struct bfq_queue *bfqq); \
886 void bfq_clear_bfqq_##name(struct bfq_queue *bfqq); \
887 int bfq_bfqq_##name(const struct bfq_queue *bfqq);
1017 struct bfq_queue *async_bfqq[2][IOPRIO_NR_LEVELS][BFQ_MAX_ACTUATORS];
1018 struct bfq_queue *async_idle_bfqq[BFQ_MAX_ACTUATORS];
1035 struct bfq_queue *async_bfqq[2][IOPRIO_NR_LEVELS][BFQ_MAX_ACTUATORS];
1036 struct bfq_queue *async_idle_bfqq[BFQ_MAX_ACTUATORS];
1049 struct bfq_queue *bic_to_bfqq(struct bfq_io_cq *bic, bool is_sync,
1051 void bic_set_bfqq(struct bfq_io_cq *bic, struct bfq_queue *bfqq, bool is_sync,
1054 void bfq_pos_tree_add_move(struct bfq_data *bfqd, struct bfq_queue *bfqq);
1055 void bfq_weights_tree_add(struct bfq_queue *bfqq);
1056 void bfq_weights_tree_remove(struct bfq_queue *bfqq);
1057 void bfq_bfqq_expire(struct bfq_data *bfqd, struct bfq_queue *bfqq,
1059 void bfq_put_queue(struct bfq_queue *bfqq);
1060 void bfq_put_cooperator(struct bfq_queue *bfqq);
1062 void bfq_release_process_ref(struct bfq_data *bfqd, struct bfq_queue *bfqq);
1077 void bfq_bfqq_move(struct bfq_data *bfqd, struct bfq_queue *bfqq,
1081 void bfqg_stats_update_io_add(struct bfq_group *bfqg, struct bfq_queue *bfqq,
1093 struct bfq_group *bfqq_group(struct bfq_queue *bfqq);
1115 * happen as a consequence of a bfq_put_queue that frees the bfq_queue
1134 struct bfq_queue *bfq_entity_to_bfqq(struct bfq_entity *entity);
1145 void bfq_bfqq_served(struct bfq_queue *bfqq, int served);
1146 void bfq_bfqq_charge_time(struct bfq_data *bfqd, struct bfq_queue *bfqq,
1151 struct bfq_queue *bfq_get_next_queue(struct bfq_data *bfqd);
1153 void bfq_deactivate_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq,
1155 void bfq_activate_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq);
1156 void bfq_requeue_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq,
1158 void bfq_del_bfqq_busy(struct bfq_queue *bfqq, bool expiration);
1159 void bfq_add_bfqq_busy(struct bfq_queue *bfqq);
1160 void bfq_add_bfqq_in_groups_with_pending_reqs(struct bfq_queue *bfqq);
1161 void bfq_del_bfqq_in_groups_with_pending_reqs(struct bfq_queue *bfqq);
1166 static inline void bfq_bfqq_name(struct bfq_queue *bfqq, char *str, int len)
1177 struct bfq_group *bfqq_group(struct bfq_queue *bfqq);