Lines Matching defs:next
188 * This function tells whether entity stops being a candidate for next
194 * next service according to the that definition, because entity is
198 * In contrast, entity could still be a candidate for next service if
201 * active children may still be the next to serve, for the parent
203 * non-queue entity is not a candidate for next-service only if it has
345 struct rb_node *next;
348 next = rb_next(&entity->rb_node);
349 st->first_idle = bfq_entity_of(next);
353 next = rb_prev(&entity->rb_node);
354 st->last_idle = bfq_entity_of(next);
900 * tree, then it is safe to invoke next function with the last
1059 * service. This is done by the next instructions. The
1285 * no more entities to touch and next loop is not executed at
1394 * conditions, but also the next one held true: the currently
1439 * for sd, and we need to know what is the new next entity to serve
1466 * Find the next entity to serve for the highest-priority
1507 * Get next queue for service.
1554 * If entity is no longer a candidate for next
1568 * extracted in one of the next iterations of this
1576 * the correct next-to-serve candidate entity for each
1579 * the next-to-serve leaf entity, we can discover
1581 * becomes the next-to-serve, and so on.
1588 * We can finally update all next-to-serve entities along the