sch_fifo.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212
  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. #include <linux/config.h>
  12. #include <linux/module.h>
  13. #include <asm/uaccess.h>
  14. #include <asm/system.h>
  15. #include <linux/bitops.h>
  16. #include <linux/types.h>
  17. #include <linux/kernel.h>
  18. #include <linux/sched.h>
  19. #include <linux/string.h>
  20. #include <linux/mm.h>
  21. #include <linux/socket.h>
  22. #include <linux/sockios.h>
  23. #include <linux/in.h>
  24. #include <linux/errno.h>
  25. #include <linux/interrupt.h>
  26. #include <linux/if_ether.h>
  27. #include <linux/inet.h>
  28. #include <linux/netdevice.h>
  29. #include <linux/etherdevice.h>
  30. #include <linux/notifier.h>
  31. #include <net/ip.h>
  32. #include <net/route.h>
  33. #include <linux/skbuff.h>
  34. #include <net/sock.h>
  35. #include <net/pkt_sched.h>
  36. /* 1 band FIFO pseudo-"scheduler" */
  37. struct fifo_sched_data
  38. {
  39. unsigned limit;
  40. };
  41. static int
  42. bfifo_enqueue(struct sk_buff *skb, struct Qdisc* sch)
  43. {
  44. struct fifo_sched_data *q = qdisc_priv(sch);
  45. if (sch->qstats.backlog + skb->len <= q->limit) {
  46. __skb_queue_tail(&sch->q, skb);
  47. sch->qstats.backlog += skb->len;
  48. sch->bstats.bytes += skb->len;
  49. sch->bstats.packets++;
  50. return 0;
  51. }
  52. sch->qstats.drops++;
  53. #ifdef CONFIG_NET_CLS_POLICE
  54. if (sch->reshape_fail==NULL || sch->reshape_fail(skb, sch))
  55. #endif
  56. kfree_skb(skb);
  57. return NET_XMIT_DROP;
  58. }
  59. static int
  60. bfifo_requeue(struct sk_buff *skb, struct Qdisc* sch)
  61. {
  62. __skb_queue_head(&sch->q, skb);
  63. sch->qstats.backlog += skb->len;
  64. sch->qstats.requeues++;
  65. return 0;
  66. }
  67. static struct sk_buff *
  68. bfifo_dequeue(struct Qdisc* sch)
  69. {
  70. struct sk_buff *skb;
  71. skb = __skb_dequeue(&sch->q);
  72. if (skb)
  73. sch->qstats.backlog -= skb->len;
  74. return skb;
  75. }
  76. static unsigned int
  77. fifo_drop(struct Qdisc* sch)
  78. {
  79. struct sk_buff *skb;
  80. skb = __skb_dequeue_tail(&sch->q);
  81. if (skb) {
  82. unsigned int len = skb->len;
  83. sch->qstats.backlog -= len;
  84. kfree_skb(skb);
  85. return len;
  86. }
  87. return 0;
  88. }
  89. static void
  90. fifo_reset(struct Qdisc* sch)
  91. {
  92. skb_queue_purge(&sch->q);
  93. sch->qstats.backlog = 0;
  94. }
  95. static int
  96. pfifo_enqueue(struct sk_buff *skb, struct Qdisc* sch)
  97. {
  98. struct fifo_sched_data *q = qdisc_priv(sch);
  99. if (sch->q.qlen < q->limit) {
  100. __skb_queue_tail(&sch->q, skb);
  101. sch->bstats.bytes += skb->len;
  102. sch->bstats.packets++;
  103. return 0;
  104. }
  105. sch->qstats.drops++;
  106. #ifdef CONFIG_NET_CLS_POLICE
  107. if (sch->reshape_fail==NULL || sch->reshape_fail(skb, sch))
  108. #endif
  109. kfree_skb(skb);
  110. return NET_XMIT_DROP;
  111. }
  112. static int
  113. pfifo_requeue(struct sk_buff *skb, struct Qdisc* sch)
  114. {
  115. __skb_queue_head(&sch->q, skb);
  116. sch->qstats.requeues++;
  117. return 0;
  118. }
  119. static struct sk_buff *
  120. pfifo_dequeue(struct Qdisc* sch)
  121. {
  122. return __skb_dequeue(&sch->q);
  123. }
  124. static int fifo_init(struct Qdisc *sch, struct rtattr *opt)
  125. {
  126. struct fifo_sched_data *q = qdisc_priv(sch);
  127. if (opt == NULL) {
  128. unsigned int limit = sch->dev->tx_queue_len ? : 1;
  129. if (sch->ops == &bfifo_qdisc_ops)
  130. q->limit = limit*sch->dev->mtu;
  131. else
  132. q->limit = limit;
  133. } else {
  134. struct tc_fifo_qopt *ctl = RTA_DATA(opt);
  135. if (opt->rta_len < RTA_LENGTH(sizeof(*ctl)))
  136. return -EINVAL;
  137. q->limit = ctl->limit;
  138. }
  139. return 0;
  140. }
  141. static int fifo_dump(struct Qdisc *sch, struct sk_buff *skb)
  142. {
  143. struct fifo_sched_data *q = qdisc_priv(sch);
  144. unsigned char *b = skb->tail;
  145. struct tc_fifo_qopt opt;
  146. opt.limit = q->limit;
  147. RTA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
  148. return skb->len;
  149. rtattr_failure:
  150. skb_trim(skb, b - skb->data);
  151. return -1;
  152. }
  153. struct Qdisc_ops pfifo_qdisc_ops = {
  154. .next = NULL,
  155. .cl_ops = NULL,
  156. .id = "pfifo",
  157. .priv_size = sizeof(struct fifo_sched_data),
  158. .enqueue = pfifo_enqueue,
  159. .dequeue = pfifo_dequeue,
  160. .requeue = pfifo_requeue,
  161. .drop = fifo_drop,
  162. .init = fifo_init,
  163. .reset = fifo_reset,
  164. .destroy = NULL,
  165. .change = fifo_init,
  166. .dump = fifo_dump,
  167. .owner = THIS_MODULE,
  168. };
  169. struct Qdisc_ops bfifo_qdisc_ops = {
  170. .next = NULL,
  171. .cl_ops = NULL,
  172. .id = "bfifo",
  173. .priv_size = sizeof(struct fifo_sched_data),
  174. .enqueue = bfifo_enqueue,
  175. .dequeue = bfifo_dequeue,
  176. .requeue = bfifo_requeue,
  177. .drop = fifo_drop,
  178. .init = fifo_init,
  179. .reset = fifo_reset,
  180. .destroy = NULL,
  181. .change = fifo_init,
  182. .dump = fifo_dump,
  183. .owner = THIS_MODULE,
  184. };
  185. EXPORT_SYMBOL(bfifo_qdisc_ops);
  186. EXPORT_SYMBOL(pfifo_qdisc_ops);