11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * net/sched/sch_fifo.c The simplest FIFO queue. 31da177e4SLinus Torvalds * 41da177e4SLinus Torvalds * This program is free software; you can redistribute it and/or 51da177e4SLinus Torvalds * modify it under the terms of the GNU General Public License 61da177e4SLinus Torvalds * as published by the Free Software Foundation; either version 71da177e4SLinus Torvalds * 2 of the License, or (at your option) any later version. 81da177e4SLinus Torvalds * 91da177e4SLinus Torvalds * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru> 101da177e4SLinus Torvalds */ 111da177e4SLinus Torvalds 121da177e4SLinus Torvalds #include <linux/config.h> 131da177e4SLinus Torvalds #include <linux/module.h> 141da177e4SLinus Torvalds #include <linux/types.h> 151da177e4SLinus Torvalds #include <linux/kernel.h> 161da177e4SLinus Torvalds #include <linux/errno.h> 171da177e4SLinus Torvalds #include <linux/netdevice.h> 181da177e4SLinus Torvalds #include <linux/skbuff.h> 191da177e4SLinus Torvalds #include <net/pkt_sched.h> 201da177e4SLinus Torvalds 211da177e4SLinus Torvalds /* 1 band FIFO pseudo-"scheduler" */ 221da177e4SLinus Torvalds 231da177e4SLinus Torvalds struct fifo_sched_data 241da177e4SLinus Torvalds { 25*6fc8e84fSThomas Graf u32 limit; 261da177e4SLinus Torvalds }; 271da177e4SLinus Torvalds 28*6fc8e84fSThomas Graf static int bfifo_enqueue(struct sk_buff *skb, struct Qdisc* sch) 291da177e4SLinus Torvalds { 301da177e4SLinus Torvalds struct fifo_sched_data *q = qdisc_priv(sch); 311da177e4SLinus Torvalds 32aaae3013SThomas Graf if (likely(sch->qstats.backlog + skb->len <= q->limit)) 33aaae3013SThomas Graf return qdisc_enqueue_tail(skb, sch); 341da177e4SLinus Torvalds 35aaae3013SThomas Graf return qdisc_reshape_fail(skb, sch); 361da177e4SLinus Torvalds } 371da177e4SLinus Torvalds 38*6fc8e84fSThomas Graf static int pfifo_enqueue(struct sk_buff *skb, struct Qdisc* sch) 391da177e4SLinus Torvalds { 401da177e4SLinus Torvalds struct fifo_sched_data *q = qdisc_priv(sch); 411da177e4SLinus Torvalds 42aaae3013SThomas Graf if (likely(skb_queue_len(&sch->q) < q->limit)) 43aaae3013SThomas Graf return qdisc_enqueue_tail(skb, sch); 441da177e4SLinus Torvalds 45aaae3013SThomas Graf return qdisc_reshape_fail(skb, sch); 461da177e4SLinus Torvalds } 471da177e4SLinus Torvalds 481da177e4SLinus Torvalds static int fifo_init(struct Qdisc *sch, struct rtattr *opt) 491da177e4SLinus Torvalds { 501da177e4SLinus Torvalds struct fifo_sched_data *q = qdisc_priv(sch); 511da177e4SLinus Torvalds 521da177e4SLinus Torvalds if (opt == NULL) { 53*6fc8e84fSThomas Graf u32 limit = sch->dev->tx_queue_len ? : 1; 541da177e4SLinus Torvalds 551da177e4SLinus Torvalds if (sch->ops == &bfifo_qdisc_ops) 56*6fc8e84fSThomas Graf limit *= sch->dev->mtu; 57*6fc8e84fSThomas Graf 581da177e4SLinus Torvalds q->limit = limit; 591da177e4SLinus Torvalds } else { 601da177e4SLinus Torvalds struct tc_fifo_qopt *ctl = RTA_DATA(opt); 61*6fc8e84fSThomas Graf 62*6fc8e84fSThomas Graf if (RTA_PAYLOAD(opt) < sizeof(*ctl)) 631da177e4SLinus Torvalds return -EINVAL; 64*6fc8e84fSThomas Graf 651da177e4SLinus Torvalds q->limit = ctl->limit; 661da177e4SLinus Torvalds } 67*6fc8e84fSThomas Graf 681da177e4SLinus Torvalds return 0; 691da177e4SLinus Torvalds } 701da177e4SLinus Torvalds 711da177e4SLinus Torvalds static int fifo_dump(struct Qdisc *sch, struct sk_buff *skb) 721da177e4SLinus Torvalds { 731da177e4SLinus Torvalds struct fifo_sched_data *q = qdisc_priv(sch); 74*6fc8e84fSThomas Graf struct tc_fifo_qopt opt = { .limit = q->limit }; 751da177e4SLinus Torvalds 761da177e4SLinus Torvalds RTA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt); 771da177e4SLinus Torvalds return skb->len; 781da177e4SLinus Torvalds 791da177e4SLinus Torvalds rtattr_failure: 801da177e4SLinus Torvalds return -1; 811da177e4SLinus Torvalds } 821da177e4SLinus Torvalds 831da177e4SLinus Torvalds struct Qdisc_ops pfifo_qdisc_ops = { 841da177e4SLinus Torvalds .id = "pfifo", 851da177e4SLinus Torvalds .priv_size = sizeof(struct fifo_sched_data), 861da177e4SLinus Torvalds .enqueue = pfifo_enqueue, 87aaae3013SThomas Graf .dequeue = qdisc_dequeue_head, 88aaae3013SThomas Graf .requeue = qdisc_requeue, 89aaae3013SThomas Graf .drop = qdisc_queue_drop, 901da177e4SLinus Torvalds .init = fifo_init, 91aaae3013SThomas Graf .reset = qdisc_reset_queue, 921da177e4SLinus Torvalds .change = fifo_init, 931da177e4SLinus Torvalds .dump = fifo_dump, 941da177e4SLinus Torvalds .owner = THIS_MODULE, 951da177e4SLinus Torvalds }; 961da177e4SLinus Torvalds 971da177e4SLinus Torvalds struct Qdisc_ops bfifo_qdisc_ops = { 981da177e4SLinus Torvalds .id = "bfifo", 991da177e4SLinus Torvalds .priv_size = sizeof(struct fifo_sched_data), 1001da177e4SLinus Torvalds .enqueue = bfifo_enqueue, 101aaae3013SThomas Graf .dequeue = qdisc_dequeue_head, 102aaae3013SThomas Graf .requeue = qdisc_requeue, 103aaae3013SThomas Graf .drop = qdisc_queue_drop, 1041da177e4SLinus Torvalds .init = fifo_init, 105aaae3013SThomas Graf .reset = qdisc_reset_queue, 1061da177e4SLinus Torvalds .change = fifo_init, 1071da177e4SLinus Torvalds .dump = fifo_dump, 1081da177e4SLinus Torvalds .owner = THIS_MODULE, 1091da177e4SLinus Torvalds }; 1101da177e4SLinus Torvalds 1111da177e4SLinus Torvalds EXPORT_SYMBOL(bfifo_qdisc_ops); 1121da177e4SLinus Torvalds EXPORT_SYMBOL(pfifo_qdisc_ops); 113