sch_generic.h 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671
  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. struct tc_ratespec rate;
  17. u32 data[256];
  18. struct qdisc_rate_table *next;
  19. int refcnt;
  20. };
  21. enum qdisc_state_t {
  22. __QDISC_STATE_SCHED,
  23. __QDISC_STATE_DEACTIVATED,
  24. __QDISC_STATE_THROTTLED,
  25. };
  26. /*
  27. * following bits are only changed while qdisc lock is held
  28. */
  29. enum qdisc___state_t {
  30. __QDISC___STATE_RUNNING = 1,
  31. };
  32. struct qdisc_size_table {
  33. struct rcu_head rcu;
  34. struct list_head list;
  35. struct tc_sizespec szopts;
  36. int refcnt;
  37. u16 data[];
  38. };
  39. struct Qdisc {
  40. int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
  41. struct sk_buff * (*dequeue)(struct Qdisc *dev);
  42. unsigned flags;
  43. #define TCQ_F_BUILTIN 1
  44. #define TCQ_F_INGRESS 2
  45. #define TCQ_F_CAN_BYPASS 4
  46. #define TCQ_F_MQROOT 8
  47. #define TCQ_F_WARN_NONWC (1 << 16)
  48. int padded;
  49. struct Qdisc_ops *ops;
  50. struct qdisc_size_table __rcu *stab;
  51. struct list_head list;
  52. u32 handle;
  53. u32 parent;
  54. atomic_t refcnt;
  55. struct gnet_stats_rate_est rate_est;
  56. int (*reshape_fail)(struct sk_buff *skb,
  57. struct Qdisc *q);
  58. void *u32_node;
  59. /* This field is deprecated, but it is still used by CBQ
  60. * and it will live until better solution will be invented.
  61. */
  62. struct Qdisc *__parent;
  63. struct netdev_queue *dev_queue;
  64. struct Qdisc *next_sched;
  65. struct sk_buff *gso_skb;
  66. /*
  67. * For performance sake on SMP, we put highly modified fields at the end
  68. */
  69. unsigned long state;
  70. struct sk_buff_head q;
  71. struct gnet_stats_basic_packed bstats;
  72. unsigned int __state;
  73. struct gnet_stats_queue qstats;
  74. struct rcu_head rcu_head;
  75. spinlock_t busylock;
  76. u32 limit;
  77. };
  78. static inline bool qdisc_is_running(const struct Qdisc *qdisc)
  79. {
  80. return (qdisc->__state & __QDISC___STATE_RUNNING) ? true : false;
  81. }
  82. static inline bool qdisc_run_begin(struct Qdisc *qdisc)
  83. {
  84. if (qdisc_is_running(qdisc))
  85. return false;
  86. qdisc->__state |= __QDISC___STATE_RUNNING;
  87. return true;
  88. }
  89. static inline void qdisc_run_end(struct Qdisc *qdisc)
  90. {
  91. qdisc->__state &= ~__QDISC___STATE_RUNNING;
  92. }
  93. static inline bool qdisc_is_throttled(const struct Qdisc *qdisc)
  94. {
  95. return test_bit(__QDISC_STATE_THROTTLED, &qdisc->state) ? true : false;
  96. }
  97. static inline void qdisc_throttled(struct Qdisc *qdisc)
  98. {
  99. set_bit(__QDISC_STATE_THROTTLED, &qdisc->state);
  100. }
  101. static inline void qdisc_unthrottled(struct Qdisc *qdisc)
  102. {
  103. clear_bit(__QDISC_STATE_THROTTLED, &qdisc->state);
  104. }
  105. struct Qdisc_class_ops {
  106. /* Child qdisc manipulation */
  107. struct netdev_queue * (*select_queue)(struct Qdisc *, struct tcmsg *);
  108. int (*graft)(struct Qdisc *, unsigned long cl,
  109. struct Qdisc *, struct Qdisc **);
  110. struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
  111. void (*qlen_notify)(struct Qdisc *, unsigned long);
  112. /* Class manipulation routines */
  113. unsigned long (*get)(struct Qdisc *, u32 classid);
  114. void (*put)(struct Qdisc *, unsigned long);
  115. int (*change)(struct Qdisc *, u32, u32,
  116. struct nlattr **, unsigned long *);
  117. int (*delete)(struct Qdisc *, unsigned long);
  118. void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
  119. /* Filter manipulation */
  120. struct tcf_proto ** (*tcf_chain)(struct Qdisc *, unsigned long);
  121. unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
  122. u32 classid);
  123. void (*unbind_tcf)(struct Qdisc *, unsigned long);
  124. /* rtnetlink specific */
  125. int (*dump)(struct Qdisc *, unsigned long,
  126. struct sk_buff *skb, struct tcmsg*);
  127. int (*dump_stats)(struct Qdisc *, unsigned long,
  128. struct gnet_dump *);
  129. };
  130. struct Qdisc_ops {
  131. struct Qdisc_ops *next;
  132. const struct Qdisc_class_ops *cl_ops;
  133. char id[IFNAMSIZ];
  134. int priv_size;
  135. int (*enqueue)(struct sk_buff *, struct Qdisc *);
  136. struct sk_buff * (*dequeue)(struct Qdisc *);
  137. struct sk_buff * (*peek)(struct Qdisc *);
  138. unsigned int (*drop)(struct Qdisc *);
  139. int (*init)(struct Qdisc *, struct nlattr *arg);
  140. void (*reset)(struct Qdisc *);
  141. void (*destroy)(struct Qdisc *);
  142. int (*change)(struct Qdisc *, struct nlattr *arg);
  143. void (*attach)(struct Qdisc *);
  144. int (*dump)(struct Qdisc *, struct sk_buff *);
  145. int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
  146. struct module *owner;
  147. };
  148. struct tcf_result {
  149. unsigned long class;
  150. u32 classid;
  151. };
  152. struct tcf_proto_ops {
  153. struct tcf_proto_ops *next;
  154. char kind[IFNAMSIZ];
  155. int (*classify)(struct sk_buff*, struct tcf_proto*,
  156. struct tcf_result *);
  157. int (*init)(struct tcf_proto*);
  158. void (*destroy)(struct tcf_proto*);
  159. unsigned long (*get)(struct tcf_proto*, u32 handle);
  160. void (*put)(struct tcf_proto*, unsigned long);
  161. int (*change)(struct tcf_proto*, unsigned long,
  162. u32 handle, struct nlattr **,
  163. unsigned long *);
  164. int (*delete)(struct tcf_proto*, unsigned long);
  165. void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
  166. /* rtnetlink specific */
  167. int (*dump)(struct tcf_proto*, unsigned long,
  168. struct sk_buff *skb, struct tcmsg*);
  169. struct module *owner;
  170. };
  171. struct tcf_proto {
  172. /* Fast access part */
  173. struct tcf_proto *next;
  174. void *root;
  175. int (*classify)(struct sk_buff*, struct tcf_proto*,
  176. struct tcf_result *);
  177. __be16 protocol;
  178. /* All the rest */
  179. u32 prio;
  180. u32 classid;
  181. struct Qdisc *q;
  182. void *data;
  183. struct tcf_proto_ops *ops;
  184. };
  185. struct qdisc_skb_cb {
  186. unsigned int pkt_len;
  187. unsigned char data[24];
  188. };
  189. static inline void qdisc_cb_private_validate(const struct sk_buff *skb, int sz)
  190. {
  191. struct qdisc_skb_cb *qcb;
  192. BUILD_BUG_ON(sizeof(skb->cb) < sizeof(unsigned int) + sz);
  193. BUILD_BUG_ON(sizeof(qcb->data) < sz);
  194. }
  195. static inline int qdisc_qlen(struct Qdisc *q)
  196. {
  197. return q->q.qlen;
  198. }
  199. static inline struct qdisc_skb_cb *qdisc_skb_cb(const struct sk_buff *skb)
  200. {
  201. return (struct qdisc_skb_cb *)skb->cb;
  202. }
  203. static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
  204. {
  205. return &qdisc->q.lock;
  206. }
  207. static inline struct Qdisc *qdisc_root(struct Qdisc *qdisc)
  208. {
  209. return qdisc->dev_queue->qdisc;
  210. }
  211. static inline struct Qdisc *qdisc_root_sleeping(struct Qdisc *qdisc)
  212. {
  213. return qdisc->dev_queue->qdisc_sleeping;
  214. }
  215. /* The qdisc root lock is a mechanism by which to top level
  216. * of a qdisc tree can be locked from any qdisc node in the
  217. * forest. This allows changing the configuration of some
  218. * aspect of the qdisc tree while blocking out asynchronous
  219. * qdisc access in the packet processing paths.
  220. *
  221. * It is only legal to do this when the root will not change
  222. * on us. Otherwise we'll potentially lock the wrong qdisc
  223. * root. This is enforced by holding the RTNL semaphore, which
  224. * all users of this lock accessor must do.
  225. */
  226. static inline spinlock_t *qdisc_root_lock(struct Qdisc *qdisc)
  227. {
  228. struct Qdisc *root = qdisc_root(qdisc);
  229. ASSERT_RTNL();
  230. return qdisc_lock(root);
  231. }
  232. static inline spinlock_t *qdisc_root_sleeping_lock(struct Qdisc *qdisc)
  233. {
  234. struct Qdisc *root = qdisc_root_sleeping(qdisc);
  235. ASSERT_RTNL();
  236. return qdisc_lock(root);
  237. }
  238. static inline struct net_device *qdisc_dev(struct Qdisc *qdisc)
  239. {
  240. return qdisc->dev_queue->dev;
  241. }
  242. static inline void sch_tree_lock(struct Qdisc *q)
  243. {
  244. spin_lock_bh(qdisc_root_sleeping_lock(q));
  245. }
  246. static inline void sch_tree_unlock(struct Qdisc *q)
  247. {
  248. spin_unlock_bh(qdisc_root_sleeping_lock(q));
  249. }
  250. #define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
  251. #define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
  252. extern struct Qdisc noop_qdisc;
  253. extern struct Qdisc_ops noop_qdisc_ops;
  254. extern struct Qdisc_ops pfifo_fast_ops;
  255. extern struct Qdisc_ops mq_qdisc_ops;
  256. struct Qdisc_class_common {
  257. u32 classid;
  258. struct hlist_node hnode;
  259. };
  260. struct Qdisc_class_hash {
  261. struct hlist_head *hash;
  262. unsigned int hashsize;
  263. unsigned int hashmask;
  264. unsigned int hashelems;
  265. };
  266. static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
  267. {
  268. id ^= id >> 8;
  269. id ^= id >> 4;
  270. return id & mask;
  271. }
  272. static inline struct Qdisc_class_common *
  273. qdisc_class_find(struct Qdisc_class_hash *hash, u32 id)
  274. {
  275. struct Qdisc_class_common *cl;
  276. struct hlist_node *n;
  277. unsigned int h;
  278. h = qdisc_class_hash(id, hash->hashmask);
  279. hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
  280. if (cl->classid == id)
  281. return cl;
  282. }
  283. return NULL;
  284. }
  285. extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
  286. extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
  287. extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
  288. extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
  289. extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
  290. extern void dev_init_scheduler(struct net_device *dev);
  291. extern void dev_shutdown(struct net_device *dev);
  292. extern void dev_activate(struct net_device *dev);
  293. extern void dev_deactivate(struct net_device *dev);
  294. extern void dev_deactivate_many(struct list_head *head);
  295. extern struct Qdisc *dev_graft_qdisc(struct netdev_queue *dev_queue,
  296. struct Qdisc *qdisc);
  297. extern void qdisc_reset(struct Qdisc *qdisc);
  298. extern void qdisc_destroy(struct Qdisc *qdisc);
  299. extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
  300. extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
  301. struct Qdisc_ops *ops);
  302. extern struct Qdisc *qdisc_create_dflt(struct netdev_queue *dev_queue,
  303. struct Qdisc_ops *ops, u32 parentid);
  304. extern void __qdisc_calculate_pkt_len(struct sk_buff *skb,
  305. const struct qdisc_size_table *stab);
  306. extern void tcf_destroy(struct tcf_proto *tp);
  307. extern void tcf_destroy_chain(struct tcf_proto **fl);
  308. /* Reset all TX qdiscs greater then index of a device. */
  309. static inline void qdisc_reset_all_tx_gt(struct net_device *dev, unsigned int i)
  310. {
  311. struct Qdisc *qdisc;
  312. for (; i < dev->num_tx_queues; i++) {
  313. qdisc = netdev_get_tx_queue(dev, i)->qdisc;
  314. if (qdisc) {
  315. spin_lock_bh(qdisc_lock(qdisc));
  316. qdisc_reset(qdisc);
  317. spin_unlock_bh(qdisc_lock(qdisc));
  318. }
  319. }
  320. }
  321. static inline void qdisc_reset_all_tx(struct net_device *dev)
  322. {
  323. qdisc_reset_all_tx_gt(dev, 0);
  324. }
  325. /* Are all TX queues of the device empty? */
  326. static inline bool qdisc_all_tx_empty(const struct net_device *dev)
  327. {
  328. unsigned int i;
  329. for (i = 0; i < dev->num_tx_queues; i++) {
  330. struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
  331. const struct Qdisc *q = txq->qdisc;
  332. if (q->q.qlen)
  333. return false;
  334. }
  335. return true;
  336. }
  337. /* Are any of the TX qdiscs changing? */
  338. static inline bool qdisc_tx_changing(struct net_device *dev)
  339. {
  340. unsigned int i;
  341. for (i = 0; i < dev->num_tx_queues; i++) {
  342. struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
  343. if (txq->qdisc != txq->qdisc_sleeping)
  344. return true;
  345. }
  346. return false;
  347. }
  348. /* Is the device using the noop qdisc on all queues? */
  349. static inline bool qdisc_tx_is_noop(const struct net_device *dev)
  350. {
  351. unsigned int i;
  352. for (i = 0; i < dev->num_tx_queues; i++) {
  353. struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
  354. if (txq->qdisc != &noop_qdisc)
  355. return false;
  356. }
  357. return true;
  358. }
  359. static inline unsigned int qdisc_pkt_len(const struct sk_buff *skb)
  360. {
  361. return qdisc_skb_cb(skb)->pkt_len;
  362. }
  363. /* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
  364. enum net_xmit_qdisc_t {
  365. __NET_XMIT_STOLEN = 0x00010000,
  366. __NET_XMIT_BYPASS = 0x00020000,
  367. };
  368. #ifdef CONFIG_NET_CLS_ACT
  369. #define net_xmit_drop_count(e) ((e) & __NET_XMIT_STOLEN ? 0 : 1)
  370. #else
  371. #define net_xmit_drop_count(e) (1)
  372. #endif
  373. static inline void qdisc_calculate_pkt_len(struct sk_buff *skb,
  374. const struct Qdisc *sch)
  375. {
  376. #ifdef CONFIG_NET_SCHED
  377. struct qdisc_size_table *stab = rcu_dereference_bh(sch->stab);
  378. if (stab)
  379. __qdisc_calculate_pkt_len(skb, stab);
  380. #endif
  381. }
  382. static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
  383. {
  384. qdisc_calculate_pkt_len(skb, sch);
  385. return sch->enqueue(skb, sch);
  386. }
  387. static inline int qdisc_enqueue_root(struct sk_buff *skb, struct Qdisc *sch)
  388. {
  389. qdisc_skb_cb(skb)->pkt_len = skb->len;
  390. return qdisc_enqueue(skb, sch) & NET_XMIT_MASK;
  391. }
  392. static inline void bstats_update(struct gnet_stats_basic_packed *bstats,
  393. const struct sk_buff *skb)
  394. {
  395. bstats->bytes += qdisc_pkt_len(skb);
  396. bstats->packets += skb_is_gso(skb) ? skb_shinfo(skb)->gso_segs : 1;
  397. }
  398. static inline void qdisc_bstats_update(struct Qdisc *sch,
  399. const struct sk_buff *skb)
  400. {
  401. bstats_update(&sch->bstats, skb);
  402. }
  403. static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
  404. struct sk_buff_head *list)
  405. {
  406. __skb_queue_tail(list, skb);
  407. sch->qstats.backlog += qdisc_pkt_len(skb);
  408. return NET_XMIT_SUCCESS;
  409. }
  410. static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
  411. {
  412. return __qdisc_enqueue_tail(skb, sch, &sch->q);
  413. }
  414. static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
  415. struct sk_buff_head *list)
  416. {
  417. struct sk_buff *skb = __skb_dequeue(list);
  418. if (likely(skb != NULL)) {
  419. sch->qstats.backlog -= qdisc_pkt_len(skb);
  420. qdisc_bstats_update(sch, skb);
  421. }
  422. return skb;
  423. }
  424. static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
  425. {
  426. return __qdisc_dequeue_head(sch, &sch->q);
  427. }
  428. static inline unsigned int __qdisc_queue_drop_head(struct Qdisc *sch,
  429. struct sk_buff_head *list)
  430. {
  431. struct sk_buff *skb = __skb_dequeue(list);
  432. if (likely(skb != NULL)) {
  433. unsigned int len = qdisc_pkt_len(skb);
  434. sch->qstats.backlog -= len;
  435. kfree_skb(skb);
  436. return len;
  437. }
  438. return 0;
  439. }
  440. static inline unsigned int qdisc_queue_drop_head(struct Qdisc *sch)
  441. {
  442. return __qdisc_queue_drop_head(sch, &sch->q);
  443. }
  444. static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
  445. struct sk_buff_head *list)
  446. {
  447. struct sk_buff *skb = __skb_dequeue_tail(list);
  448. if (likely(skb != NULL))
  449. sch->qstats.backlog -= qdisc_pkt_len(skb);
  450. return skb;
  451. }
  452. static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
  453. {
  454. return __qdisc_dequeue_tail(sch, &sch->q);
  455. }
  456. static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
  457. {
  458. return skb_peek(&sch->q);
  459. }
  460. /* generic pseudo peek method for non-work-conserving qdisc */
  461. static inline struct sk_buff *qdisc_peek_dequeued(struct Qdisc *sch)
  462. {
  463. /* we can reuse ->gso_skb because peek isn't called for root qdiscs */
  464. if (!sch->gso_skb) {
  465. sch->gso_skb = sch->dequeue(sch);
  466. if (sch->gso_skb)
  467. /* it's still part of the queue */
  468. sch->q.qlen++;
  469. }
  470. return sch->gso_skb;
  471. }
  472. /* use instead of qdisc->dequeue() for all qdiscs queried with ->peek() */
  473. static inline struct sk_buff *qdisc_dequeue_peeked(struct Qdisc *sch)
  474. {
  475. struct sk_buff *skb = sch->gso_skb;
  476. if (skb) {
  477. sch->gso_skb = NULL;
  478. sch->q.qlen--;
  479. } else {
  480. skb = sch->dequeue(sch);
  481. }
  482. return skb;
  483. }
  484. static inline void __qdisc_reset_queue(struct Qdisc *sch,
  485. struct sk_buff_head *list)
  486. {
  487. /*
  488. * We do not know the backlog in bytes of this list, it
  489. * is up to the caller to correct it
  490. */
  491. __skb_queue_purge(list);
  492. }
  493. static inline void qdisc_reset_queue(struct Qdisc *sch)
  494. {
  495. __qdisc_reset_queue(sch, &sch->q);
  496. sch->qstats.backlog = 0;
  497. }
  498. static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
  499. struct sk_buff_head *list)
  500. {
  501. struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
  502. if (likely(skb != NULL)) {
  503. unsigned int len = qdisc_pkt_len(skb);
  504. kfree_skb(skb);
  505. return len;
  506. }
  507. return 0;
  508. }
  509. static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
  510. {
  511. return __qdisc_queue_drop(sch, &sch->q);
  512. }
  513. static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
  514. {
  515. kfree_skb(skb);
  516. sch->qstats.drops++;
  517. return NET_XMIT_DROP;
  518. }
  519. static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
  520. {
  521. sch->qstats.drops++;
  522. #ifdef CONFIG_NET_CLS_ACT
  523. if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
  524. goto drop;
  525. return NET_XMIT_SUCCESS;
  526. drop:
  527. #endif
  528. kfree_skb(skb);
  529. return NET_XMIT_DROP;
  530. }
  531. /* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
  532. long it will take to send a packet given its size.
  533. */
  534. static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
  535. {
  536. int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
  537. if (slot < 0)
  538. slot = 0;
  539. slot >>= rtab->rate.cell_log;
  540. if (slot > 255)
  541. return rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF];
  542. return rtab->data[slot];
  543. }
  544. #ifdef CONFIG_NET_CLS_ACT
  545. static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask,
  546. int action)
  547. {
  548. struct sk_buff *n;
  549. n = skb_clone(skb, gfp_mask);
  550. if (n) {
  551. n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
  552. n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
  553. n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
  554. }
  555. return n;
  556. }
  557. #endif
  558. #endif