sch_generic.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457
  1. #ifndef __NET_SCHED_GENERIC_H
  2. #define __NET_SCHED_GENERIC_H
  3. #include <linux/netdevice.h>
  4. #include <linux/types.h>
  5. #include <linux/rcupdate.h>
  6. #include <linux/module.h>
  7. #include <linux/pkt_sched.h>
  8. #include <linux/pkt_cls.h>
  9. #include <net/gen_stats.h>
  10. #include <net/rtnetlink.h>
  11. struct Qdisc_ops;
  12. struct qdisc_walker;
  13. struct tcf_walker;
  14. struct module;
  15. struct qdisc_rate_table
  16. {
  17. struct tc_ratespec rate;
  18. u32 data[256];
  19. struct qdisc_rate_table *next;
  20. int refcnt;
  21. };
  22. enum qdisc_state_t
  23. {
  24. __QDISC_STATE_RUNNING,
  25. __QDISC_STATE_SCHED,
  26. };
  27. struct Qdisc
  28. {
  29. int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
  30. struct sk_buff * (*dequeue)(struct Qdisc *dev);
  31. unsigned flags;
  32. #define TCQ_F_BUILTIN 1
  33. #define TCQ_F_THROTTLED 2
  34. #define TCQ_F_INGRESS 4
  35. int padded;
  36. struct Qdisc_ops *ops;
  37. u32 handle;
  38. u32 parent;
  39. atomic_t refcnt;
  40. unsigned long state;
  41. struct sk_buff *gso_skb;
  42. struct sk_buff_head q;
  43. struct netdev_queue *dev_queue;
  44. struct Qdisc *next_sched;
  45. struct list_head list;
  46. struct gnet_stats_basic bstats;
  47. struct gnet_stats_queue qstats;
  48. struct gnet_stats_rate_est rate_est;
  49. struct rcu_head q_rcu;
  50. int (*reshape_fail)(struct sk_buff *skb,
  51. struct Qdisc *q);
  52. /* This field is deprecated, but it is still used by CBQ
  53. * and it will live until better solution will be invented.
  54. */
  55. struct Qdisc *__parent;
  56. };
  57. struct Qdisc_class_ops
  58. {
  59. /* Child qdisc manipulation */
  60. int (*graft)(struct Qdisc *, unsigned long cl,
  61. struct Qdisc *, struct Qdisc **);
  62. struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
  63. void (*qlen_notify)(struct Qdisc *, unsigned long);
  64. /* Class manipulation routines */
  65. unsigned long (*get)(struct Qdisc *, u32 classid);
  66. void (*put)(struct Qdisc *, unsigned long);
  67. int (*change)(struct Qdisc *, u32, u32,
  68. struct nlattr **, unsigned long *);
  69. int (*delete)(struct Qdisc *, unsigned long);
  70. void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
  71. /* Filter manipulation */
  72. struct tcf_proto ** (*tcf_chain)(struct Qdisc *, unsigned long);
  73. unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
  74. u32 classid);
  75. void (*unbind_tcf)(struct Qdisc *, unsigned long);
  76. /* rtnetlink specific */
  77. int (*dump)(struct Qdisc *, unsigned long,
  78. struct sk_buff *skb, struct tcmsg*);
  79. int (*dump_stats)(struct Qdisc *, unsigned long,
  80. struct gnet_dump *);
  81. };
  82. struct Qdisc_ops
  83. {
  84. struct Qdisc_ops *next;
  85. const struct Qdisc_class_ops *cl_ops;
  86. char id[IFNAMSIZ];
  87. int priv_size;
  88. int (*enqueue)(struct sk_buff *, struct Qdisc *);
  89. struct sk_buff * (*dequeue)(struct Qdisc *);
  90. int (*requeue)(struct sk_buff *, struct Qdisc *);
  91. unsigned int (*drop)(struct Qdisc *);
  92. int (*init)(struct Qdisc *, struct nlattr *arg);
  93. void (*reset)(struct Qdisc *);
  94. void (*destroy)(struct Qdisc *);
  95. int (*change)(struct Qdisc *, struct nlattr *arg);
  96. int (*dump)(struct Qdisc *, struct sk_buff *);
  97. int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
  98. struct module *owner;
  99. };
  100. struct tcf_result
  101. {
  102. unsigned long class;
  103. u32 classid;
  104. };
  105. struct tcf_proto_ops
  106. {
  107. struct tcf_proto_ops *next;
  108. char kind[IFNAMSIZ];
  109. int (*classify)(struct sk_buff*, struct tcf_proto*,
  110. struct tcf_result *);
  111. int (*init)(struct tcf_proto*);
  112. void (*destroy)(struct tcf_proto*);
  113. unsigned long (*get)(struct tcf_proto*, u32 handle);
  114. void (*put)(struct tcf_proto*, unsigned long);
  115. int (*change)(struct tcf_proto*, unsigned long,
  116. u32 handle, struct nlattr **,
  117. unsigned long *);
  118. int (*delete)(struct tcf_proto*, unsigned long);
  119. void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
  120. /* rtnetlink specific */
  121. int (*dump)(struct tcf_proto*, unsigned long,
  122. struct sk_buff *skb, struct tcmsg*);
  123. struct module *owner;
  124. };
  125. struct tcf_proto
  126. {
  127. /* Fast access part */
  128. struct tcf_proto *next;
  129. void *root;
  130. int (*classify)(struct sk_buff*, struct tcf_proto*,
  131. struct tcf_result *);
  132. __be16 protocol;
  133. /* All the rest */
  134. u32 prio;
  135. u32 classid;
  136. struct Qdisc *q;
  137. void *data;
  138. struct tcf_proto_ops *ops;
  139. };
  140. static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
  141. {
  142. return &qdisc->q.lock;
  143. }
  144. static inline struct Qdisc *qdisc_root(struct Qdisc *qdisc)
  145. {
  146. return qdisc->dev_queue->qdisc;
  147. }
  148. static inline spinlock_t *qdisc_root_lock(struct Qdisc *qdisc)
  149. {
  150. struct Qdisc *root = qdisc_root(qdisc);
  151. return qdisc_lock(root);
  152. }
  153. static inline struct net_device *qdisc_dev(struct Qdisc *qdisc)
  154. {
  155. return qdisc->dev_queue->dev;
  156. }
  157. static inline void sch_tree_lock(struct Qdisc *q)
  158. {
  159. spin_lock_bh(qdisc_root_lock(q));
  160. }
  161. static inline void sch_tree_unlock(struct Qdisc *q)
  162. {
  163. spin_unlock_bh(qdisc_root_lock(q));
  164. }
  165. #define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
  166. #define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
  167. extern struct Qdisc noop_qdisc;
  168. extern struct Qdisc_ops noop_qdisc_ops;
  169. struct Qdisc_class_common
  170. {
  171. u32 classid;
  172. struct hlist_node hnode;
  173. };
  174. struct Qdisc_class_hash
  175. {
  176. struct hlist_head *hash;
  177. unsigned int hashsize;
  178. unsigned int hashmask;
  179. unsigned int hashelems;
  180. };
  181. static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
  182. {
  183. id ^= id >> 8;
  184. id ^= id >> 4;
  185. return id & mask;
  186. }
  187. static inline struct Qdisc_class_common *
  188. qdisc_class_find(struct Qdisc_class_hash *hash, u32 id)
  189. {
  190. struct Qdisc_class_common *cl;
  191. struct hlist_node *n;
  192. unsigned int h;
  193. h = qdisc_class_hash(id, hash->hashmask);
  194. hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
  195. if (cl->classid == id)
  196. return cl;
  197. }
  198. return NULL;
  199. }
  200. extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
  201. extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
  202. extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
  203. extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
  204. extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
  205. extern void dev_init_scheduler(struct net_device *dev);
  206. extern void dev_shutdown(struct net_device *dev);
  207. extern void dev_activate(struct net_device *dev);
  208. extern void dev_deactivate(struct net_device *dev);
  209. extern void qdisc_reset(struct Qdisc *qdisc);
  210. extern void qdisc_destroy(struct Qdisc *qdisc);
  211. extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
  212. extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
  213. struct Qdisc_ops *ops);
  214. extern struct Qdisc *qdisc_create_dflt(struct net_device *dev,
  215. struct netdev_queue *dev_queue,
  216. struct Qdisc_ops *ops, u32 parentid);
  217. extern void tcf_destroy(struct tcf_proto *tp);
  218. extern void tcf_destroy_chain(struct tcf_proto **fl);
  219. /* Reset all TX qdiscs of a device. */
  220. static inline void qdisc_reset_all_tx(struct net_device *dev)
  221. {
  222. unsigned int i;
  223. for (i = 0; i < dev->num_tx_queues; i++)
  224. qdisc_reset(netdev_get_tx_queue(dev, i)->qdisc);
  225. }
  226. /* Are all TX queues of the device empty? */
  227. static inline bool qdisc_all_tx_empty(const struct net_device *dev)
  228. {
  229. unsigned int i;
  230. for (i = 0; i < dev->num_tx_queues; i++) {
  231. struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
  232. const struct Qdisc *q = txq->qdisc;
  233. if (q->q.qlen)
  234. return false;
  235. }
  236. return true;
  237. }
  238. /* Are any of the TX qdiscs changing? */
  239. static inline bool qdisc_tx_changing(struct net_device *dev)
  240. {
  241. unsigned int i;
  242. for (i = 0; i < dev->num_tx_queues; i++) {
  243. struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
  244. if (txq->qdisc != txq->qdisc_sleeping)
  245. return true;
  246. }
  247. return false;
  248. }
  249. /* Is the device using the noop qdisc on all queues? */
  250. static inline bool qdisc_tx_is_noop(const struct net_device *dev)
  251. {
  252. unsigned int i;
  253. for (i = 0; i < dev->num_tx_queues; i++) {
  254. struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
  255. if (txq->qdisc != &noop_qdisc)
  256. return false;
  257. }
  258. return true;
  259. }
  260. static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
  261. struct sk_buff_head *list)
  262. {
  263. __skb_queue_tail(list, skb);
  264. sch->qstats.backlog += skb->len;
  265. sch->bstats.bytes += skb->len;
  266. sch->bstats.packets++;
  267. return NET_XMIT_SUCCESS;
  268. }
  269. static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
  270. {
  271. return __qdisc_enqueue_tail(skb, sch, &sch->q);
  272. }
  273. static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
  274. struct sk_buff_head *list)
  275. {
  276. struct sk_buff *skb = __skb_dequeue(list);
  277. if (likely(skb != NULL))
  278. sch->qstats.backlog -= skb->len;
  279. return skb;
  280. }
  281. static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
  282. {
  283. return __qdisc_dequeue_head(sch, &sch->q);
  284. }
  285. static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
  286. struct sk_buff_head *list)
  287. {
  288. struct sk_buff *skb = __skb_dequeue_tail(list);
  289. if (likely(skb != NULL))
  290. sch->qstats.backlog -= skb->len;
  291. return skb;
  292. }
  293. static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
  294. {
  295. return __qdisc_dequeue_tail(sch, &sch->q);
  296. }
  297. static inline int __qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch,
  298. struct sk_buff_head *list)
  299. {
  300. __skb_queue_head(list, skb);
  301. sch->qstats.backlog += skb->len;
  302. sch->qstats.requeues++;
  303. return NET_XMIT_SUCCESS;
  304. }
  305. static inline int qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch)
  306. {
  307. return __qdisc_requeue(skb, sch, &sch->q);
  308. }
  309. static inline void __qdisc_reset_queue(struct Qdisc *sch,
  310. struct sk_buff_head *list)
  311. {
  312. /*
  313. * We do not know the backlog in bytes of this list, it
  314. * is up to the caller to correct it
  315. */
  316. __skb_queue_purge(list);
  317. }
  318. static inline void qdisc_reset_queue(struct Qdisc *sch)
  319. {
  320. __qdisc_reset_queue(sch, &sch->q);
  321. sch->qstats.backlog = 0;
  322. }
  323. static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
  324. struct sk_buff_head *list)
  325. {
  326. struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
  327. if (likely(skb != NULL)) {
  328. unsigned int len = skb->len;
  329. kfree_skb(skb);
  330. return len;
  331. }
  332. return 0;
  333. }
  334. static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
  335. {
  336. return __qdisc_queue_drop(sch, &sch->q);
  337. }
  338. static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
  339. {
  340. kfree_skb(skb);
  341. sch->qstats.drops++;
  342. return NET_XMIT_DROP;
  343. }
  344. static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
  345. {
  346. sch->qstats.drops++;
  347. #ifdef CONFIG_NET_CLS_ACT
  348. if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
  349. goto drop;
  350. return NET_XMIT_SUCCESS;
  351. drop:
  352. #endif
  353. kfree_skb(skb);
  354. return NET_XMIT_DROP;
  355. }
  356. /* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
  357. long it will take to send a packet given its size.
  358. */
  359. static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
  360. {
  361. int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
  362. if (slot < 0)
  363. slot = 0;
  364. slot >>= rtab->rate.cell_log;
  365. if (slot > 255)
  366. return (rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF]);
  367. return rtab->data[slot];
  368. }
  369. #ifdef CONFIG_NET_CLS_ACT
  370. static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask)
  371. {
  372. struct sk_buff *n = skb_clone(skb, gfp_mask);
  373. if (n) {
  374. n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
  375. n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
  376. n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
  377. }
  378. return n;
  379. }
  380. #endif
  381. #endif