blob: d468b479aa937f410a665045eb4018bfc08de255 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * net/sched/sch_fifo.c The simplest FIFO queue.
3 *
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.
8 *
9 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
10 */
11
Linus Torvalds1da177e2005-04-16 15:20:36 -070012#include <linux/module.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090013#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070014#include <linux/types.h>
15#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016#include <linux/errno.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070017#include <linux/skbuff.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070018#include <net/pkt_sched.h>
19
20/* 1 band FIFO pseudo-"scheduler" */
21
22struct fifo_sched_data
23{
Thomas Graf6fc8e842005-06-18 22:58:00 -070024 u32 limit;
Linus Torvalds1da177e2005-04-16 15:20:36 -070025};
26
Thomas Graf6fc8e842005-06-18 22:58:00 -070027static int bfifo_enqueue(struct sk_buff *skb, struct Qdisc* sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -070028{
29 struct fifo_sched_data *q = qdisc_priv(sch);
30
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -070031 if (likely(sch->qstats.backlog + qdisc_pkt_len(skb) <= q->limit))
Thomas Grafaaae3012005-06-18 22:57:42 -070032 return qdisc_enqueue_tail(skb, sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -070033
Thomas Grafaaae3012005-06-18 22:57:42 -070034 return qdisc_reshape_fail(skb, sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -070035}
36
Thomas Graf6fc8e842005-06-18 22:58:00 -070037static int pfifo_enqueue(struct sk_buff *skb, struct Qdisc* sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -070038{
39 struct fifo_sched_data *q = qdisc_priv(sch);
40
Thomas Grafaaae3012005-06-18 22:57:42 -070041 if (likely(skb_queue_len(&sch->q) < q->limit))
42 return qdisc_enqueue_tail(skb, sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -070043
Thomas Grafaaae3012005-06-18 22:57:42 -070044 return qdisc_reshape_fail(skb, sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -070045}
46
Hagen Paul Pfeifer57dbb2d2010-01-24 12:30:59 +000047static int pfifo_tail_enqueue(struct sk_buff *skb, struct Qdisc* sch)
48{
Hagen Paul Pfeifer57dbb2d2010-01-24 12:30:59 +000049 struct fifo_sched_data *q = qdisc_priv(sch);
50
51 if (likely(skb_queue_len(&sch->q) < q->limit))
52 return qdisc_enqueue_tail(skb, sch);
53
54 /* queue full, remove one skb to fulfill the limit */
Eric Dumazet9190b3b2011-01-20 23:31:33 -080055 __qdisc_queue_drop_head(sch, &sch->q);
Hagen Paul Pfeifer57dbb2d2010-01-24 12:30:59 +000056 sch->qstats.drops++;
Hagen Paul Pfeifer57dbb2d2010-01-24 12:30:59 +000057 qdisc_enqueue_tail(skb, sch);
58
59 return NET_XMIT_CN;
60}
61
Patrick McHardy1e904742008-01-22 22:11:17 -080062static int fifo_init(struct Qdisc *sch, struct nlattr *opt)
Linus Torvalds1da177e2005-04-16 15:20:36 -070063{
64 struct fifo_sched_data *q = qdisc_priv(sch);
65
66 if (opt == NULL) {
David S. Miller5ce2d482008-07-08 17:06:30 -070067 u32 limit = qdisc_dev(sch)->tx_queue_len ? : 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -070068
69 if (sch->ops == &bfifo_qdisc_ops)
Patrick McHardy64739902009-05-06 16:45:07 -070070 limit *= psched_mtu(qdisc_dev(sch));
Thomas Graf6fc8e842005-06-18 22:58:00 -070071
72 q->limit = limit;
Linus Torvalds1da177e2005-04-16 15:20:36 -070073 } else {
Patrick McHardy1e904742008-01-22 22:11:17 -080074 struct tc_fifo_qopt *ctl = nla_data(opt);
Thomas Graf6fc8e842005-06-18 22:58:00 -070075
Patrick McHardy1e904742008-01-22 22:11:17 -080076 if (nla_len(opt) < sizeof(*ctl))
Linus Torvalds1da177e2005-04-16 15:20:36 -070077 return -EINVAL;
Thomas Graf6fc8e842005-06-18 22:58:00 -070078
Linus Torvalds1da177e2005-04-16 15:20:36 -070079 q->limit = ctl->limit;
80 }
Thomas Graf6fc8e842005-06-18 22:58:00 -070081
Linus Torvalds1da177e2005-04-16 15:20:36 -070082 return 0;
83}
84
85static int fifo_dump(struct Qdisc *sch, struct sk_buff *skb)
86{
87 struct fifo_sched_data *q = qdisc_priv(sch);
Thomas Graf6fc8e842005-06-18 22:58:00 -070088 struct tc_fifo_qopt opt = { .limit = q->limit };
Linus Torvalds1da177e2005-04-16 15:20:36 -070089
Patrick McHardy1e904742008-01-22 22:11:17 -080090 NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
Linus Torvalds1da177e2005-04-16 15:20:36 -070091 return skb->len;
92
Patrick McHardy1e904742008-01-22 22:11:17 -080093nla_put_failure:
Linus Torvalds1da177e2005-04-16 15:20:36 -070094 return -1;
95}
96
Eric Dumazet20fea082007-11-14 01:44:41 -080097struct Qdisc_ops pfifo_qdisc_ops __read_mostly = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070098 .id = "pfifo",
99 .priv_size = sizeof(struct fifo_sched_data),
100 .enqueue = pfifo_enqueue,
Thomas Grafaaae3012005-06-18 22:57:42 -0700101 .dequeue = qdisc_dequeue_head,
Patrick McHardy48a8f512008-10-31 00:44:18 -0700102 .peek = qdisc_peek_head,
Thomas Grafaaae3012005-06-18 22:57:42 -0700103 .drop = qdisc_queue_drop,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104 .init = fifo_init,
Thomas Grafaaae3012005-06-18 22:57:42 -0700105 .reset = qdisc_reset_queue,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106 .change = fifo_init,
107 .dump = fifo_dump,
108 .owner = THIS_MODULE,
109};
Patrick McHardy62e3ba12008-01-22 22:10:23 -0800110EXPORT_SYMBOL(pfifo_qdisc_ops);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700111
Eric Dumazet20fea082007-11-14 01:44:41 -0800112struct Qdisc_ops bfifo_qdisc_ops __read_mostly = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113 .id = "bfifo",
114 .priv_size = sizeof(struct fifo_sched_data),
115 .enqueue = bfifo_enqueue,
Thomas Grafaaae3012005-06-18 22:57:42 -0700116 .dequeue = qdisc_dequeue_head,
Patrick McHardy48a8f512008-10-31 00:44:18 -0700117 .peek = qdisc_peek_head,
Thomas Grafaaae3012005-06-18 22:57:42 -0700118 .drop = qdisc_queue_drop,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119 .init = fifo_init,
Thomas Grafaaae3012005-06-18 22:57:42 -0700120 .reset = qdisc_reset_queue,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121 .change = fifo_init,
122 .dump = fifo_dump,
123 .owner = THIS_MODULE,
124};
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125EXPORT_SYMBOL(bfifo_qdisc_ops);
Patrick McHardyfb0305c2008-07-05 23:40:21 -0700126
Hagen Paul Pfeifer57dbb2d2010-01-24 12:30:59 +0000127struct Qdisc_ops pfifo_head_drop_qdisc_ops __read_mostly = {
128 .id = "pfifo_head_drop",
129 .priv_size = sizeof(struct fifo_sched_data),
130 .enqueue = pfifo_tail_enqueue,
131 .dequeue = qdisc_dequeue_head,
132 .peek = qdisc_peek_head,
133 .drop = qdisc_queue_drop_head,
134 .init = fifo_init,
135 .reset = qdisc_reset_queue,
136 .change = fifo_init,
137 .dump = fifo_dump,
138 .owner = THIS_MODULE,
139};
140
Patrick McHardyfb0305c2008-07-05 23:40:21 -0700141/* Pass size change message down to embedded FIFO */
142int fifo_set_limit(struct Qdisc *q, unsigned int limit)
143{
144 struct nlattr *nla;
145 int ret = -ENOMEM;
146
147 /* Hack to avoid sending change message to non-FIFO */
148 if (strncmp(q->ops->id + 1, "fifo", 4) != 0)
149 return 0;
150
151 nla = kmalloc(nla_attr_size(sizeof(struct tc_fifo_qopt)), GFP_KERNEL);
152 if (nla) {
153 nla->nla_type = RTM_NEWQDISC;
154 nla->nla_len = nla_attr_size(sizeof(struct tc_fifo_qopt));
155 ((struct tc_fifo_qopt *)nla_data(nla))->limit = limit;
156
157 ret = q->ops->change(q, nla);
158 kfree(nla);
159 }
160 return ret;
161}
162EXPORT_SYMBOL(fifo_set_limit);
163
164struct Qdisc *fifo_create_dflt(struct Qdisc *sch, struct Qdisc_ops *ops,
165 unsigned int limit)
166{
167 struct Qdisc *q;
168 int err = -ENOMEM;
169
Changli Gao3511c912010-10-16 13:04:08 +0000170 q = qdisc_create_dflt(sch->dev_queue, ops, TC_H_MAKE(sch->handle, 1));
Patrick McHardyfb0305c2008-07-05 23:40:21 -0700171 if (q) {
172 err = fifo_set_limit(q, limit);
173 if (err < 0) {
174 qdisc_destroy(q);
175 q = NULL;
176 }
177 }
178
179 return q ? : ERR_PTR(err);
180}
181EXPORT_SYMBOL(fifo_create_dflt);