Lines Matching defs:ER
192 * struct qfq_queue. We rely on ER, IR, EB, IB being numbered 0..3
194 enum qfq_state { ER, IR, EB, IB, QFQ_MAX_STATE };
350 * The state computation relies on ER=0, IR=1, EB=2, IB=3
359 unsigned long mask = mask_from(q->bitmaps[ER], grp->index);
387 unsigned long mask = mask_from(q->bitmaps[ER], index + 1);
397 qfq_move_groups(q, mask, EB, ER);
422 qfq_move_groups(q, mask, IR, ER);
506 if (!q->bitmaps[ER]) {
554 if (!q->bitmaps[ER]) {
560 grp = qfq_ffs(q, q->bitmaps[ER]);
578 if (!cl) { /* group gone, remove from ER */
579 __clear_bit(grp->index, &q->bitmaps[ER]);
589 /* remove from ER and put in the new set */
590 __clear_bit(grp->index, &q->bitmaps[ER]);
600 NO(if (!q->bitmaps[ER] && q->queued)
614 * the ordering in ER. So, if we have groups in ER, set S to
631 mask = mask_from(q->bitmaps[ER], cl->grp->index);
683 * was in ER make sure to adjust V.
693 } else if (!q->bitmaps[ER] && qfq_gt(roundedS, q->V))
756 * Do ER last because if we were blocking other groups
763 if (test_bit(grp->index, &q->bitmaps[ER]) &&
764 !(q->bitmaps[ER] & ~((1UL << grp->index) - 1))) {
765 mask = q->bitmaps[ER] & ((1UL << grp->index) - 1);
770 qfq_move_groups(q, mask, EB, ER);
773 __clear_bit(grp->index, &q->bitmaps[ER]);
778 __clear_bit(grp->index, &q->bitmaps[ER]);
877 D(" ER 0x%08x", (unsigned)q->bitmaps[ER]);