Merge branch 'for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/roland...
[linux-2.6-block.git] / net / sched / sch_fifo.c
CommitLineData
1da177e4
LT
1/*
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
1da177e4 12#include <linux/module.h>
5a0e3ad6 13#include <linux/slab.h>
1da177e4
LT
14#include <linux/types.h>
15#include <linux/kernel.h>
1da177e4 16#include <linux/errno.h>
1da177e4 17#include <linux/skbuff.h>
1da177e4
LT
18#include <net/pkt_sched.h>
19
20/* 1 band FIFO pseudo-"scheduler" */
21
cc7ec456 22static int bfifo_enqueue(struct sk_buff *skb, struct Qdisc *sch)
1da177e4 23{
d276055c 24 if (likely(sch->qstats.backlog + qdisc_pkt_len(skb) <= sch->limit))
aaae3013 25 return qdisc_enqueue_tail(skb, sch);
1da177e4 26
aaae3013 27 return qdisc_reshape_fail(skb, sch);
1da177e4
LT
28}
29
cc7ec456 30static int pfifo_enqueue(struct sk_buff *skb, struct Qdisc *sch)
1da177e4 31{
d276055c 32 if (likely(skb_queue_len(&sch->q) < sch->limit))
aaae3013 33 return qdisc_enqueue_tail(skb, sch);
1da177e4 34
aaae3013 35 return qdisc_reshape_fail(skb, sch);
1da177e4
LT
36}
37
cc7ec456 38static int pfifo_tail_enqueue(struct sk_buff *skb, struct Qdisc *sch)
57dbb2d8 39{
d276055c 40 if (likely(skb_queue_len(&sch->q) < sch->limit))
57dbb2d8
HPP
41 return qdisc_enqueue_tail(skb, sch);
42
43 /* queue full, remove one skb to fulfill the limit */
9190b3b3 44 __qdisc_queue_drop_head(sch, &sch->q);
57dbb2d8 45 sch->qstats.drops++;
57dbb2d8
HPP
46 qdisc_enqueue_tail(skb, sch);
47
48 return NET_XMIT_CN;
49}
50
1e90474c 51static int fifo_init(struct Qdisc *sch, struct nlattr *opt)
1da177e4 52{
23624935
ED
53 bool bypass;
54 bool is_bfifo = sch->ops == &bfifo_qdisc_ops;
1da177e4
LT
55
56 if (opt == NULL) {
5ce2d488 57 u32 limit = qdisc_dev(sch)->tx_queue_len ? : 1;
1da177e4 58
23624935 59 if (is_bfifo)
6473990c 60 limit *= psched_mtu(qdisc_dev(sch));
6fc8e84f 61
d276055c 62 sch->limit = limit;
1da177e4 63 } else {
1e90474c 64 struct tc_fifo_qopt *ctl = nla_data(opt);
6fc8e84f 65
1e90474c 66 if (nla_len(opt) < sizeof(*ctl))
1da177e4 67 return -EINVAL;
6fc8e84f 68
d276055c 69 sch->limit = ctl->limit;
1da177e4 70 }
6fc8e84f 71
23624935 72 if (is_bfifo)
d276055c 73 bypass = sch->limit >= psched_mtu(qdisc_dev(sch));
23624935 74 else
d276055c 75 bypass = sch->limit >= 1;
23624935
ED
76
77 if (bypass)
78 sch->flags |= TCQ_F_CAN_BYPASS;
79 else
80 sch->flags &= ~TCQ_F_CAN_BYPASS;
1da177e4
LT
81 return 0;
82}
83
84static int fifo_dump(struct Qdisc *sch, struct sk_buff *skb)
85{
d276055c 86 struct tc_fifo_qopt opt = { .limit = sch->limit };
1da177e4 87
1e90474c 88 NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
1da177e4
LT
89 return skb->len;
90
1e90474c 91nla_put_failure:
1da177e4
LT
92 return -1;
93}
94
20fea08b 95struct Qdisc_ops pfifo_qdisc_ops __read_mostly = {
1da177e4 96 .id = "pfifo",
d276055c 97 .priv_size = 0,
1da177e4 98 .enqueue = pfifo_enqueue,
aaae3013 99 .dequeue = qdisc_dequeue_head,
48a8f519 100 .peek = qdisc_peek_head,
aaae3013 101 .drop = qdisc_queue_drop,
1da177e4 102 .init = fifo_init,
aaae3013 103 .reset = qdisc_reset_queue,
1da177e4
LT
104 .change = fifo_init,
105 .dump = fifo_dump,
106 .owner = THIS_MODULE,
107};
62e3ba1b 108EXPORT_SYMBOL(pfifo_qdisc_ops);
1da177e4 109
20fea08b 110struct Qdisc_ops bfifo_qdisc_ops __read_mostly = {
1da177e4 111 .id = "bfifo",
d276055c 112 .priv_size = 0,
1da177e4 113 .enqueue = bfifo_enqueue,
aaae3013 114 .dequeue = qdisc_dequeue_head,
48a8f519 115 .peek = qdisc_peek_head,
aaae3013 116 .drop = qdisc_queue_drop,
1da177e4 117 .init = fifo_init,
aaae3013 118 .reset = qdisc_reset_queue,
1da177e4
LT
119 .change = fifo_init,
120 .dump = fifo_dump,
121 .owner = THIS_MODULE,
122};
1da177e4 123EXPORT_SYMBOL(bfifo_qdisc_ops);
fb0305ce 124
57dbb2d8
HPP
125struct Qdisc_ops pfifo_head_drop_qdisc_ops __read_mostly = {
126 .id = "pfifo_head_drop",
d276055c 127 .priv_size = 0,
57dbb2d8
HPP
128 .enqueue = pfifo_tail_enqueue,
129 .dequeue = qdisc_dequeue_head,
130 .peek = qdisc_peek_head,
131 .drop = qdisc_queue_drop_head,
132 .init = fifo_init,
133 .reset = qdisc_reset_queue,
134 .change = fifo_init,
135 .dump = fifo_dump,
136 .owner = THIS_MODULE,
137};
138
fb0305ce
PM
139/* Pass size change message down to embedded FIFO */
140int fifo_set_limit(struct Qdisc *q, unsigned int limit)
141{
142 struct nlattr *nla;
143 int ret = -ENOMEM;
144
145 /* Hack to avoid sending change message to non-FIFO */
146 if (strncmp(q->ops->id + 1, "fifo", 4) != 0)
147 return 0;
148
149 nla = kmalloc(nla_attr_size(sizeof(struct tc_fifo_qopt)), GFP_KERNEL);
150 if (nla) {
151 nla->nla_type = RTM_NEWQDISC;
152 nla->nla_len = nla_attr_size(sizeof(struct tc_fifo_qopt));
153 ((struct tc_fifo_qopt *)nla_data(nla))->limit = limit;
154
155 ret = q->ops->change(q, nla);
156 kfree(nla);
157 }
158 return ret;
159}
160EXPORT_SYMBOL(fifo_set_limit);
161
162struct Qdisc *fifo_create_dflt(struct Qdisc *sch, struct Qdisc_ops *ops,
163 unsigned int limit)
164{
165 struct Qdisc *q;
166 int err = -ENOMEM;
167
3511c913 168 q = qdisc_create_dflt(sch->dev_queue, ops, TC_H_MAKE(sch->handle, 1));
fb0305ce
PM
169 if (q) {
170 err = fifo_set_limit(q, limit);
171 if (err < 0) {
172 qdisc_destroy(q);
173 q = NULL;
174 }
175 }
176
177 return q ? : ERR_PTR(err);
178}
179EXPORT_SYMBOL(fifo_create_dflt);