Lines Matching defs:bfq_slice_idle
174 static u64 bfq_slice_idle = NSEC_PER_SEC / 125;
1674 bfqd->bfq_slice_idle * 3;
3007 sl = bfqd->bfq_slice_idle;
3790 *delta_ms = bfq_slice_idle / NSEC_PER_MSEC;
3859 * namely bfqd->bfq_slice_idle, and (2) a few extra jiffies. We
3863 * bfqd->bfq_slice_idle tends to filter out greedy applications,
3898 * bfqd->bfq_slice_idle:
3900 * higher than bfqd->bfq_slice_idle. This happens, e.g., on slow
3902 * that the approximation, in jiffies, of bfqd->bfq_slice_idle
3908 * reference time interval just bfqd->bfq_slice_idle, but
3909 * bfqd->bfq_slice_idle plus a few jiffies. In particular, we add the
3920 jiffies + nsecs_to_jiffies(bfqq->bfqd->bfq_slice_idle) + 4);
4240 if (bfqd->bfq_slice_idle == 0 || !bfq_bfqq_sync(bfqq) ||
4315 bfqd->bfq_slice_idle)
5235 elapsed = min_t(u64, elapsed, 2ULL * bfqd->bfq_slice_idle);
5264 * idle io prio class, or if bfq_slice_idle is zero, because
5268 bfqd->bfq_slice_idle == 0)
5282 bfqq->ttime.ttime_mean > bfqd->bfq_slice_idle))
6505 bfqd->bfq_slice_idle = bfq_slice_idle;
6615 SHOW_FUNCTION(bfq_slice_idle_show, bfqd->bfq_slice_idle, 2);
6630 USEC_SHOW_FUNCTION(bfq_slice_idle_us_show, bfqd->bfq_slice_idle);
6663 STORE_FUNCTION(bfq_slice_idle_store, &bfqd->bfq_slice_idle, 0, INT_MAX, 2);
6683 USEC_STORE_FUNCTION(bfq_slice_idle_us_store, &bfqd->bfq_slice_idle, 0,
6752 && bfqd->bfq_slice_idle < 8 * NSEC_PER_MSEC)
6753 bfqd->bfq_slice_idle = 8 * NSEC_PER_MSEC;