net/sched/sch_qfq.c

1367

i = (grp->front + offset) % QFQ_MAX_SLOTS;

net/sched/sch_qfq.c

1469

for (j = 0; j < QFQ_MAX_SLOTS; j++)

net/sched/sch_qfq.c

175

struct hlist_head slots[QFQ_MAX_SLOTS];

net/sched/sch_qfq.c

900

if (unlikely(slot > QFQ_MAX_SLOTS - 2)) {

net/sched/sch_qfq.c

902

((u64)(QFQ_MAX_SLOTS - 2)<<grp->slot_shift);

net/sched/sch_qfq.c

905

slot = QFQ_MAX_SLOTS - 2;

net/sched/sch_qfq.c

908

i = (grp->front + slot) % QFQ_MAX_SLOTS;

net/sched/sch_qfq.c

951

grp->front = (grp->front + i) % QFQ_MAX_SLOTS;

net/sched/sch_qfq.c

972

grp->front = (grp->front - i) % QFQ_MAX_SLOTS;