blob: c2689f4ba8de9a3fdd364c6a4e3537852f1261a2 [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>
Linus Torvalds1da177e2005-04-16 15:20:36 -070013#include <linux/types.h>
14#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070015#include <linux/errno.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016#include <linux/netdevice.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
Thomas Grafaaae3012005-06-18 22:57:42 -070031 if (likely(sch->qstats.backlog + skb->len <= q->limit))
32 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
47static int fifo_init(struct Qdisc *sch, struct rtattr *opt)
48{
49 struct fifo_sched_data *q = qdisc_priv(sch);
50
51 if (opt == NULL) {
Thomas Graf6fc8e842005-06-18 22:58:00 -070052 u32 limit = sch->dev->tx_queue_len ? : 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -070053
54 if (sch->ops == &bfifo_qdisc_ops)
Thomas Graf6fc8e842005-06-18 22:58:00 -070055 limit *= sch->dev->mtu;
56
57 q->limit = limit;
Linus Torvalds1da177e2005-04-16 15:20:36 -070058 } else {
59 struct tc_fifo_qopt *ctl = RTA_DATA(opt);
Thomas Graf6fc8e842005-06-18 22:58:00 -070060
61 if (RTA_PAYLOAD(opt) < sizeof(*ctl))
Linus Torvalds1da177e2005-04-16 15:20:36 -070062 return -EINVAL;
Thomas Graf6fc8e842005-06-18 22:58:00 -070063
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 q->limit = ctl->limit;
65 }
Thomas Graf6fc8e842005-06-18 22:58:00 -070066
Linus Torvalds1da177e2005-04-16 15:20:36 -070067 return 0;
68}
69
70static int fifo_dump(struct Qdisc *sch, struct sk_buff *skb)
71{
72 struct fifo_sched_data *q = qdisc_priv(sch);
Thomas Graf6fc8e842005-06-18 22:58:00 -070073 struct tc_fifo_qopt opt = { .limit = q->limit };
Linus Torvalds1da177e2005-04-16 15:20:36 -070074
Linus Torvalds1da177e2005-04-16 15:20:36 -070075 RTA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
Linus Torvalds1da177e2005-04-16 15:20:36 -070076 return skb->len;
77
78rtattr_failure:
Linus Torvalds1da177e2005-04-16 15:20:36 -070079 return -1;
80}
81
82struct Qdisc_ops pfifo_qdisc_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070083 .id = "pfifo",
84 .priv_size = sizeof(struct fifo_sched_data),
85 .enqueue = pfifo_enqueue,
Thomas Grafaaae3012005-06-18 22:57:42 -070086 .dequeue = qdisc_dequeue_head,
87 .requeue = qdisc_requeue,
88 .drop = qdisc_queue_drop,
Linus Torvalds1da177e2005-04-16 15:20:36 -070089 .init = fifo_init,
Thomas Grafaaae3012005-06-18 22:57:42 -070090 .reset = qdisc_reset_queue,
Linus Torvalds1da177e2005-04-16 15:20:36 -070091 .change = fifo_init,
92 .dump = fifo_dump,
93 .owner = THIS_MODULE,
94};
95
96struct Qdisc_ops bfifo_qdisc_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070097 .id = "bfifo",
98 .priv_size = sizeof(struct fifo_sched_data),
99 .enqueue = bfifo_enqueue,
Thomas Grafaaae3012005-06-18 22:57:42 -0700100 .dequeue = qdisc_dequeue_head,
101 .requeue = qdisc_requeue,
102 .drop = qdisc_queue_drop,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 .init = fifo_init,
Thomas Grafaaae3012005-06-18 22:57:42 -0700104 .reset = qdisc_reset_queue,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105 .change = fifo_init,
106 .dump = fifo_dump,
107 .owner = THIS_MODULE,
108};
109
110EXPORT_SYMBOL(bfifo_qdisc_ops);
111EXPORT_SYMBOL(pfifo_qdisc_ops);