2 * net/sched/sch_fifo.c The simplest FIFO queue.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
9 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
12 #include <linux/module.h>
13 #include <linux/slab.h>
14 #include <linux/types.h>
15 #include <linux/kernel.h>
16 #include <linux/errno.h>
17 #include <linux/skbuff.h>
18 #include <net/pkt_sched.h>
20 /* 1 band FIFO pseudo-"scheduler" */
22 struct fifo_sched_data
27 static int bfifo_enqueue(struct sk_buff *skb, struct Qdisc* sch)
29 struct fifo_sched_data *q = qdisc_priv(sch);
31 if (likely(sch->qstats.backlog + qdisc_pkt_len(skb) <= q->limit))
32 return qdisc_enqueue_tail(skb, sch);
34 return qdisc_reshape_fail(skb, sch);
37 static int pfifo_enqueue(struct sk_buff *skb, struct Qdisc* sch)
39 struct fifo_sched_data *q = qdisc_priv(sch);
41 if (likely(skb_queue_len(&sch->q) < q->limit))
42 return qdisc_enqueue_tail(skb, sch);
44 return qdisc_reshape_fail(skb, sch);
47 static int pfifo_tail_enqueue(struct sk_buff *skb, struct Qdisc* sch)
49 struct sk_buff *skb_head;
50 struct fifo_sched_data *q = qdisc_priv(sch);
52 if (likely(skb_queue_len(&sch->q) < q->limit))
53 return qdisc_enqueue_tail(skb, sch);
55 /* queue full, remove one skb to fulfill the limit */
56 skb_head = qdisc_dequeue_head(sch);
60 qdisc_enqueue_tail(skb, sch);
65 static int fifo_init(struct Qdisc *sch, struct nlattr *opt)
67 struct fifo_sched_data *q = qdisc_priv(sch);
70 u32 limit = qdisc_dev(sch)->tx_queue_len ? : 1;
72 if (sch->ops == &bfifo_qdisc_ops)
73 limit *= psched_mtu(qdisc_dev(sch));
77 struct tc_fifo_qopt *ctl = nla_data(opt);
79 if (nla_len(opt) < sizeof(*ctl))
82 q->limit = ctl->limit;
88 static int fifo_dump(struct Qdisc *sch, struct sk_buff *skb)
90 struct fifo_sched_data *q = qdisc_priv(sch);
91 struct tc_fifo_qopt opt = { .limit = q->limit };
93 NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
100 struct Qdisc_ops pfifo_qdisc_ops __read_mostly = {
102 .priv_size = sizeof(struct fifo_sched_data),
103 .enqueue = pfifo_enqueue,
104 .dequeue = qdisc_dequeue_head,
105 .peek = qdisc_peek_head,
106 .drop = qdisc_queue_drop,
108 .reset = qdisc_reset_queue,
111 .owner = THIS_MODULE,
113 EXPORT_SYMBOL(pfifo_qdisc_ops);
115 struct Qdisc_ops bfifo_qdisc_ops __read_mostly = {
117 .priv_size = sizeof(struct fifo_sched_data),
118 .enqueue = bfifo_enqueue,
119 .dequeue = qdisc_dequeue_head,
120 .peek = qdisc_peek_head,
121 .drop = qdisc_queue_drop,
123 .reset = qdisc_reset_queue,
126 .owner = THIS_MODULE,
128 EXPORT_SYMBOL(bfifo_qdisc_ops);
130 struct Qdisc_ops pfifo_head_drop_qdisc_ops __read_mostly = {
131 .id = "pfifo_head_drop",
132 .priv_size = sizeof(struct fifo_sched_data),
133 .enqueue = pfifo_tail_enqueue,
134 .dequeue = qdisc_dequeue_head,
135 .peek = qdisc_peek_head,
136 .drop = qdisc_queue_drop_head,
138 .reset = qdisc_reset_queue,
141 .owner = THIS_MODULE,
144 /* Pass size change message down to embedded FIFO */
145 int fifo_set_limit(struct Qdisc *q, unsigned int limit)
150 /* Hack to avoid sending change message to non-FIFO */
151 if (strncmp(q->ops->id + 1, "fifo", 4) != 0)
154 nla = kmalloc(nla_attr_size(sizeof(struct tc_fifo_qopt)), GFP_KERNEL);
156 nla->nla_type = RTM_NEWQDISC;
157 nla->nla_len = nla_attr_size(sizeof(struct tc_fifo_qopt));
158 ((struct tc_fifo_qopt *)nla_data(nla))->limit = limit;
160 ret = q->ops->change(q, nla);
165 EXPORT_SYMBOL(fifo_set_limit);
167 struct Qdisc *fifo_create_dflt(struct Qdisc *sch, struct Qdisc_ops *ops,
173 q = qdisc_create_dflt(sch->dev_queue, ops, TC_H_MAKE(sch->handle, 1));
175 err = fifo_set_limit(q, limit);
182 return q ? : ERR_PTR(err);
184 EXPORT_SYMBOL(fifo_create_dflt);