pkt_sched: Add ->peek() methods for fifo, prio and SFQ qdiscs.

From: Patrick McHardy <kaber@trash.net>

Just as a demonstration how easy adding a peek operation to the
work-conserving qdiscs actually is. It doesn't need to keep or change
any internal state in many cases thanks to the guarantee that the
packet will either be dequeued or, if another packet arrives, the
upper qdisc will immediately ->peek again to reevaluate the state.

(This is only slightly modified Patrick's patch.)

Signed-off-by: Jarek Poplawski <jarkao2@gmail.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
This commit is contained in:
Patrick McHardy 2008-10-31 00:44:18 -07:00 committed by David S. Miller
parent 90d841fd0a
commit 48a8f519e0
4 changed files with 33 additions and 0 deletions

View file

@ -433,6 +433,11 @@ static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
return __qdisc_dequeue_tail(sch, &sch->q); return __qdisc_dequeue_tail(sch, &sch->q);
} }
static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
{
return skb_peek(&sch->q);
}
static inline int __qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch, static inline int __qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch,
struct sk_buff_head *list) struct sk_buff_head *list)
{ {

View file

@ -83,6 +83,7 @@ struct Qdisc_ops pfifo_qdisc_ops __read_mostly = {
.priv_size = sizeof(struct fifo_sched_data), .priv_size = sizeof(struct fifo_sched_data),
.enqueue = pfifo_enqueue, .enqueue = pfifo_enqueue,
.dequeue = qdisc_dequeue_head, .dequeue = qdisc_dequeue_head,
.peek = qdisc_peek_head,
.requeue = qdisc_requeue, .requeue = qdisc_requeue,
.drop = qdisc_queue_drop, .drop = qdisc_queue_drop,
.init = fifo_init, .init = fifo_init,
@ -98,6 +99,7 @@ struct Qdisc_ops bfifo_qdisc_ops __read_mostly = {
.priv_size = sizeof(struct fifo_sched_data), .priv_size = sizeof(struct fifo_sched_data),
.enqueue = bfifo_enqueue, .enqueue = bfifo_enqueue,
.dequeue = qdisc_dequeue_head, .dequeue = qdisc_dequeue_head,
.peek = qdisc_peek_head,
.requeue = qdisc_requeue, .requeue = qdisc_requeue,
.drop = qdisc_queue_drop, .drop = qdisc_queue_drop,
.init = fifo_init, .init = fifo_init,

View file

@ -120,6 +120,19 @@ prio_requeue(struct sk_buff *skb, struct Qdisc* sch)
return ret; return ret;
} }
static struct sk_buff *prio_peek(struct Qdisc *sch)
{
struct prio_sched_data *q = qdisc_priv(sch);
int prio;
for (prio = 0; prio < q->bands; prio++) {
struct Qdisc *qdisc = q->queues[prio];
struct sk_buff *skb = qdisc->ops->peek(qdisc);
if (skb)
return skb;
}
return NULL;
}
static struct sk_buff *prio_dequeue(struct Qdisc* sch) static struct sk_buff *prio_dequeue(struct Qdisc* sch)
{ {
@ -421,6 +434,7 @@ static struct Qdisc_ops prio_qdisc_ops __read_mostly = {
.priv_size = sizeof(struct prio_sched_data), .priv_size = sizeof(struct prio_sched_data),
.enqueue = prio_enqueue, .enqueue = prio_enqueue,
.dequeue = prio_dequeue, .dequeue = prio_dequeue,
.peek = prio_peek,
.requeue = prio_requeue, .requeue = prio_requeue,
.drop = prio_drop, .drop = prio_drop,
.init = prio_init, .init = prio_init,

View file

@ -391,8 +391,19 @@ sfq_requeue(struct sk_buff *skb, struct Qdisc *sch)
return NET_XMIT_CN; return NET_XMIT_CN;
} }
static struct sk_buff *
sfq_peek(struct Qdisc *sch)
{
struct sfq_sched_data *q = qdisc_priv(sch);
sfq_index a;
/* No active slots */
if (q->tail == SFQ_DEPTH)
return NULL;
a = q->next[q->tail];
return skb_peek(&q->qs[a]);
}
static struct sk_buff * static struct sk_buff *
sfq_dequeue(struct Qdisc *sch) sfq_dequeue(struct Qdisc *sch)
@ -624,6 +635,7 @@ static struct Qdisc_ops sfq_qdisc_ops __read_mostly = {
.priv_size = sizeof(struct sfq_sched_data), .priv_size = sizeof(struct sfq_sched_data),
.enqueue = sfq_enqueue, .enqueue = sfq_enqueue,
.dequeue = sfq_dequeue, .dequeue = sfq_dequeue,
.peek = sfq_peek,
.requeue = sfq_requeue, .requeue = sfq_requeue,
.drop = sfq_drop, .drop = sfq_drop,
.init = sfq_init, .init = sfq_init,