Lines Matching refs:first
215 * first requests from each cooperator. After that, there is very
327 * countermeasure. To introduce this countermeasure, we need first to
447 /* bic->icq is the first member, %NULL will convert to %NULL */
834 * The above first case (symmetric scenario) occurs when:
1023 /* Follow expired path, else get first next available. */
1058 * If the first request of a queue changes we make sure that the queue
1059 * has enough budget to serve at least its first request (if the
1061 * budget for its first request, it has to go through two dispatch
1342 * . when the very first queue is created, the queue is inserted into the
1343 * list (as it could be the first queue in a possible burst)
1378 * . Q is inserted in the burst list, as Q may be the first queue
1402 * the very first queue created after BFQ is selected for this
1409 * to happen, as bfqq may be the first queue of the first
1441 * case, bfqq has become the first queue in the possible new
1548 * reasons), and 2) such a request has arrived soon. The first
1566 * to achieve, service trees need first to be updated to know whether
1935 * explicitly about two cases. The first is that bfqq has to
2105 * of some of the in-flight requests. In particular, on the first time, Q is
2123 * first I/O-plugging time interval for bfqq. This triggers the first
2147 * since the first detection. If wakeups are rare, pointless idling
2789 * first time that the requests of some process are redirected to
2913 /* if a merge has already been setup, then proceed with that first */
3169 * bfqq even before bfq_add_request is executed for the first
3510 * So, the first step is to compute the weight as a function
3515 * incremented for the first sample.
3595 if (bfqd->peak_rate_samples == 0) { /* first dispatch */
3665 * from risking to be, first, uselessly decremented, and then
3798 * the first queue receives requests of 8 sectors, while the
3820 * whether the scenario is asymmetric. To explain the first
4332 * Charging time to the first type of queues and the exact service to
4508 * The value of the variable is computed considering, first, that
4720 * in the drive may easily make the next first
4897 container_of(bfqq->woken_list.first,
4911 * The first if checks whether the process associated
5654 /* first request is almost certainly seeky */
6511 * A first definition comes in handy to introduce the algorithm by
6512 * which the inject limit is computed. We define as first request for
6516 * injection on the service times of only the first requests of
6519 * first to arrive after injection possibly occurred.
6522 * "total service time" of first requests. We define as total service
6536 * easily evaluated by just comparing the total service time of first
6540 * first request of bfqq, the algorithm measures the total time of the
7009 * first request of the in-service queue arrives
7233 * oom_bfqq's first activation. The oom_bfqq's ioprio and ioprio