Home
last modified time | relevance | path

Searched refs:IOPRIO_NR_LEVELS (Results 1 – 5 of 5) sorted by relevance

/linux/include/uapi/linux/
H A Dioprio.h43 #define IOPRIO_NR_LEVELS (1 << IOPRIO_LEVEL_NR_BITS) macro
44 #define IOPRIO_LEVEL_MASK (IOPRIO_NR_LEVELS - 1)
47 #define IOPRIO_BE_NR IOPRIO_NR_LEVELS
114 IOPRIO_BAD_VALUE(priolevel, IOPRIO_NR_LEVELS) || in ioprio_value()
/linux/block/
H A Dioprio.c52 if (level >= IOPRIO_NR_LEVELS) in ioprio_check_cap()
H A Dbfq-iosched.h1014 struct bfq_queue *async_bfqq[2][IOPRIO_NR_LEVELS][BFQ_MAX_ACTUATORS];
1032 struct bfq_queue *async_bfqq[2][IOPRIO_NR_LEVELS][BFQ_MAX_ACTUATORS];
H A Dbfq-wf2q.c507 return (IOPRIO_NR_LEVELS - ioprio) * BFQ_WEIGHT_CONVERSION_COEFF; in bfq_ioprio_to_weight()
521 IOPRIO_NR_LEVELS - weight / BFQ_WEIGHT_CONVERSION_COEFF); in bfq_weight_to_ioprio()
H A Dbfq-iosched.c2651 for (j = 0; j < IOPRIO_NR_LEVELS; j++) in bfq_end_wr_async_queues()
5555 bfqq->new_ioprio = IOPRIO_NR_LEVELS - 1; in bfq_set_next_ioprio_data()
5559 if (bfqq->new_ioprio >= IOPRIO_NR_LEVELS) { in bfq_set_next_ioprio_data()
5562 bfqq->new_ioprio = IOPRIO_NR_LEVELS - 1; in bfq_set_next_ioprio_data()
7110 for (j = 0; j < IOPRIO_NR_LEVELS; j++) in bfq_put_async_queues()