Lines Matching defs:bfqq
241 * cgroup, to be sure that it does not disappear while a bfqq still
304 /* node for active/idle bfqq list inside parent bfqd */
310 /* when bfqq started to do I/O within the last observation window */
312 /* how long bfqq has remained empty during the last observ. window */
415 * struct bfq_data - bfqq data unique and persistent for associated bfq_io_cq
484 * process is inserted into the queue pointed by bfqq[i][j] if
490 struct bfq_queue *bfqq[2][BFQ_MAX_ACTUATORS];
499 * (one queue per actuator, see field bfqq above). In
633 /* bfqq owning the last completed rq */
636 /* last bfqq created, among those in the root group */
795 /* fallback dummy bfqq for extreme OOM conditions */
809 /* bfqq associated with the task issuing current bio for merging */
868 * bfqq has timed-out at least once
873 * bfqq activated in a large burst,
880 BFQQF_coop, /* bfqq is shared */
881 BFQQF_split_coop, /* shared bfqq will be split */
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);
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);
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,
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)
1168 char type = bfq_bfqq_sync(bfqq) ? 'S' : 'A';
1170 if (bfqq->pid != -1)
1171 snprintf(str, len, "bfq%d%c", bfqq->pid, type);
1177 struct bfq_group *bfqq_group(struct bfq_queue *bfqq);
1179 #define bfq_log_bfqq(bfqd, bfqq, fmt, args...) do { \
1183 bfq_bfqq_name((bfqq), pid_str, MAX_BFQQ_NAME_LENGTH); \
1185 &bfqg_to_blkg(bfqq_group(bfqq))->blkcg->css, \
1196 #define bfq_log_bfqq(bfqd, bfqq, fmt, args...) do { \
1200 bfq_bfqq_name((bfqq), pid_str, MAX_BFQQ_NAME_LENGTH); \