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