[deliverable/linux.git] / include / net / sch_generic.h

#ifndef __NET_SCHED_GENERIC_H
#define __NET_SCHED_GENERIC_H

#include <linux/netdevice.h>
#include <linux/types.h>
#include <linux/rcupdate.h>
#include <linux/module.h>
#include <linux/pkt_sched.h>
#include <linux/pkt_cls.h>
#include <net/gen_stats.h>
#include <net/rtnetlink.h>

struct Qdisc_ops;
struct qdisc_walker;
struct tcf_walker;
struct module;

struct qdisc_rate_table
{
	struct tc_ratespec rate;
	u32		data[256];
	struct qdisc_rate_table *next;
	int		refcnt;
};

enum qdisc_state_t
{
	__QDISC_STATE_RUNNING,
	__QDISC_STATE_SCHED,
	__QDISC_STATE_DEACTIVATED,
};

struct qdisc_size_table {
	struct list_head	list;
	struct tc_sizespec	szopts;
	int			refcnt;
	u16			data[];
};

struct Qdisc
{
	int 			(*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
	struct sk_buff *	(*dequeue)(struct Qdisc *dev);
	unsigned		flags;
#define TCQ_F_BUILTIN		1
#define TCQ_F_THROTTLED		2
#define TCQ_F_INGRESS		4
#define TCQ_F_CAN_BYPASS	8
#define TCQ_F_WARN_NONWC	(1 << 16)
	int			padded;
	struct Qdisc_ops	*ops;
	struct qdisc_size_table	*stab;
	struct list_head	list;
	u32			handle;
	u32			parent;
	atomic_t		refcnt;
	struct gnet_stats_rate_est	rate_est;
	int			(*reshape_fail)(struct sk_buff *skb,
					struct Qdisc *q);

	void			*u32_node;

	/* This field is deprecated, but it is still used by CBQ
	 * and it will live until better solution will be invented.
	 */
	struct Qdisc		*__parent;
	struct netdev_queue	*dev_queue;
	struct Qdisc		*next_sched;

	struct sk_buff		*gso_skb;
	/*
	 * For performance sake on SMP, we put highly modified fields at the end
	 */
	unsigned long		state;
	struct sk_buff_head	q;
	struct gnet_stats_basic_packed bstats;
	struct gnet_stats_queue	qstats;
};

struct Qdisc_class_ops
{
	/* Child qdisc manipulation */
	int			(*graft)(struct Qdisc *, unsigned long cl,
					struct Qdisc *, struct Qdisc **);
	struct Qdisc *		(*leaf)(struct Qdisc *, unsigned long cl);
	void			(*qlen_notify)(struct Qdisc *, unsigned long);

	/* Class manipulation routines */
	unsigned long		(*get)(struct Qdisc *, u32 classid);
	void			(*put)(struct Qdisc *, unsigned long);
	int			(*change)(struct Qdisc *, u32, u32,
					struct nlattr **, unsigned long *);
	int			(*delete)(struct Qdisc *, unsigned long);
	void			(*walk)(struct Qdisc *, struct qdisc_walker * arg);

	/* Filter manipulation */
	struct tcf_proto **	(*tcf_chain)(struct Qdisc *, unsigned long);
	unsigned long		(*bind_tcf)(struct Qdisc *, unsigned long,
					u32 classid);
	void			(*unbind_tcf)(struct Qdisc *, unsigned long);

	/* rtnetlink specific */
	int			(*dump)(struct Qdisc *, unsigned long,
					struct sk_buff *skb, struct tcmsg*);
	int			(*dump_stats)(struct Qdisc *, unsigned long,
					struct gnet_dump *);
};

struct Qdisc_ops
{
	struct Qdisc_ops	*next;
	const struct Qdisc_class_ops	*cl_ops;
	char			id[IFNAMSIZ];
	int			priv_size;

	int 			(*enqueue)(struct sk_buff *, struct Qdisc *);
	struct sk_buff *	(*dequeue)(struct Qdisc *);
	struct sk_buff *	(*peek)(struct Qdisc *);
	unsigned int		(*drop)(struct Qdisc *);

	int			(*init)(struct Qdisc *, struct nlattr *arg);
	void			(*reset)(struct Qdisc *);
	void			(*destroy)(struct Qdisc *);
	int			(*change)(struct Qdisc *, struct nlattr *arg);

	int			(*dump)(struct Qdisc *, struct sk_buff *);
	int			(*dump_stats)(struct Qdisc *, struct gnet_dump *);

	struct module		*owner;
};


struct tcf_result
{
	unsigned long	class;
	u32		classid;
};

struct tcf_proto_ops
{
	struct tcf_proto_ops	*next;
	char			kind[IFNAMSIZ];

	int			(*classify)(struct sk_buff*, struct tcf_proto*,
					struct tcf_result *);
	int			(*init)(struct tcf_proto*);
	void			(*destroy)(struct tcf_proto*);

	unsigned long		(*get)(struct tcf_proto*, u32 handle);
	void			(*put)(struct tcf_proto*, unsigned long);
	int			(*change)(struct tcf_proto*, unsigned long,
					u32 handle, struct nlattr **,
					unsigned long *);
	int			(*delete)(struct tcf_proto*, unsigned long);
	void			(*walk)(struct tcf_proto*, struct tcf_walker *arg);

	/* rtnetlink specific */
	int			(*dump)(struct tcf_proto*, unsigned long,
					struct sk_buff *skb, struct tcmsg*);

	struct module		*owner;
};

struct tcf_proto
{
	/* Fast access part */
	struct tcf_proto	*next;
	void			*root;
	int			(*classify)(struct sk_buff*, struct tcf_proto*,
					struct tcf_result *);
	__be16			protocol;

	/* All the rest */
	u32			prio;
	u32			classid;
	struct Qdisc		*q;
	void			*data;
	struct tcf_proto_ops	*ops;
};

struct qdisc_skb_cb {
	unsigned int		pkt_len;
	char			data[];
};

static inline int qdisc_qlen(struct Qdisc *q)
{
	return q->q.qlen;
}

static inline struct qdisc_skb_cb *qdisc_skb_cb(struct sk_buff *skb)
{
	return (struct qdisc_skb_cb *)skb->cb;
}

static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
{
	return &qdisc->q.lock;
}

static inline struct Qdisc *qdisc_root(struct Qdisc *qdisc)
{
	return qdisc->dev_queue->qdisc;
}

static inline struct Qdisc *qdisc_root_sleeping(struct Qdisc *qdisc)
{
	return qdisc->dev_queue->qdisc_sleeping;
}

/* The qdisc root lock is a mechanism by which to top level
 * of a qdisc tree can be locked from any qdisc node in the
 * forest.  This allows changing the configuration of some
 * aspect of the qdisc tree while blocking out asynchronous
 * qdisc access in the packet processing paths.
 *
 * It is only legal to do this when the root will not change
 * on us.  Otherwise we'll potentially lock the wrong qdisc
 * root.  This is enforced by holding the RTNL semaphore, which
 * all users of this lock accessor must do.
 */
static inline spinlock_t *qdisc_root_lock(struct Qdisc *qdisc)
{
	struct Qdisc *root = qdisc_root(qdisc);

	ASSERT_RTNL();
	return qdisc_lock(root);
}

static inline spinlock_t *qdisc_root_sleeping_lock(struct Qdisc *qdisc)
{
	struct Qdisc *root = qdisc_root_sleeping(qdisc);

	ASSERT_RTNL();
	return qdisc_lock(root);
}

static inline struct net_device *qdisc_dev(struct Qdisc *qdisc)
{
	return qdisc->dev_queue->dev;
}

static inline void sch_tree_lock(struct Qdisc *q)
{
	spin_lock_bh(qdisc_root_sleeping_lock(q));
}

static inline void sch_tree_unlock(struct Qdisc *q)
{
	spin_unlock_bh(qdisc_root_sleeping_lock(q));
}

#define tcf_tree_lock(tp)	sch_tree_lock((tp)->q)
#define tcf_tree_unlock(tp)	sch_tree_unlock((tp)->q)

extern struct Qdisc noop_qdisc;
extern struct Qdisc_ops noop_qdisc_ops;

struct Qdisc_class_common
{
	u32			classid;
	struct hlist_node	hnode;
};

struct Qdisc_class_hash
{
	struct hlist_head	*hash;
	unsigned int		hashsize;
	unsigned int		hashmask;
	unsigned int		hashelems;
};

static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
{
	id ^= id >> 8;
	id ^= id >> 4;
	return id & mask;
}

static inline struct Qdisc_class_common *
qdisc_class_find(struct Qdisc_class_hash *hash, u32 id)
{
	struct Qdisc_class_common *cl;
	struct hlist_node *n;
	unsigned int h;

	h = qdisc_class_hash(id, hash->hashmask);
	hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
		if (cl->classid == id)
			return cl;
	}
	return NULL;
}

extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);

extern void dev_init_scheduler(struct net_device *dev);
extern void dev_shutdown(struct net_device *dev);
extern void dev_activate(struct net_device *dev);
extern void dev_deactivate(struct net_device *dev);
extern void qdisc_reset(struct Qdisc *qdisc);
extern void qdisc_destroy(struct Qdisc *qdisc);
extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
				 struct Qdisc_ops *ops);
extern struct Qdisc *qdisc_create_dflt(struct net_device *dev,
				       struct netdev_queue *dev_queue,
				       struct Qdisc_ops *ops, u32 parentid);
extern void qdisc_calculate_pkt_len(struct sk_buff *skb,
				   struct qdisc_size_table *stab);
extern void tcf_destroy(struct tcf_proto *tp);
extern void tcf_destroy_chain(struct tcf_proto **fl);

/* Reset all TX qdiscs of a device.  */
static inline void qdisc_reset_all_tx(struct net_device *dev)
{
	unsigned int i;
	for (i = 0; i < dev->num_tx_queues; i++)
		qdisc_reset(netdev_get_tx_queue(dev, i)->qdisc);
}

/* Are all TX queues of the device empty?  */
static inline bool qdisc_all_tx_empty(const struct net_device *dev)
{
	unsigned int i;
	for (i = 0; i < dev->num_tx_queues; i++) {
		struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
		const struct Qdisc *q = txq->qdisc;

		if (q->q.qlen)
			return false;
	}
	return true;
}

/* Are any of the TX qdiscs changing?  */
static inline bool qdisc_tx_changing(struct net_device *dev)
{
	unsigned int i;
	for (i = 0; i < dev->num_tx_queues; i++) {
		struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
		if (txq->qdisc != txq->qdisc_sleeping)
			return true;
	}
	return false;
}

/* Is the device using the noop qdisc on all queues?  */
static inline bool qdisc_tx_is_noop(const struct net_device *dev)
{
	unsigned int i;
	for (i = 0; i < dev->num_tx_queues; i++) {
		struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
		if (txq->qdisc != &noop_qdisc)
			return false;
	}
	return true;
}

static inline unsigned int qdisc_pkt_len(struct sk_buff *skb)
{
	return qdisc_skb_cb(skb)->pkt_len;
}

/* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
enum net_xmit_qdisc_t {
	__NET_XMIT_STOLEN = 0x00010000,
	__NET_XMIT_BYPASS = 0x00020000,
};

#ifdef CONFIG_NET_CLS_ACT
#define net_xmit_drop_count(e)	((e) & __NET_XMIT_STOLEN ? 0 : 1)
#else
#define net_xmit_drop_count(e)	(1)
#endif

static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
{
#ifdef CONFIG_NET_SCHED
	if (sch->stab)
		qdisc_calculate_pkt_len(skb, sch->stab);
#endif
	return sch->enqueue(skb, sch);
}

static inline int qdisc_enqueue_root(struct sk_buff *skb, struct Qdisc *sch)
{
	qdisc_skb_cb(skb)->pkt_len = skb->len;
	return qdisc_enqueue(skb, sch) & NET_XMIT_MASK;
}

static inline void __qdisc_update_bstats(struct Qdisc *sch, unsigned int len)
{
	sch->bstats.bytes += len;
	sch->bstats.packets++;
}

static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
				       struct sk_buff_head *list)
{
	__skb_queue_tail(list, skb);
	sch->qstats.backlog += qdisc_pkt_len(skb);
	__qdisc_update_bstats(sch, qdisc_pkt_len(skb));

	return NET_XMIT_SUCCESS;
}

static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
{
	return __qdisc_enqueue_tail(skb, sch, &sch->q);
}

static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
						   struct sk_buff_head *list)
{
	struct sk_buff *skb = __skb_dequeue(list);

	if (likely(skb != NULL))
		sch->qstats.backlog -= qdisc_pkt_len(skb);

	return skb;
}

static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
{
	return __qdisc_dequeue_head(sch, &sch->q);
}

static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
						   struct sk_buff_head *list)
{
	struct sk_buff *skb = __skb_dequeue_tail(list);

	if (likely(skb != NULL))
		sch->qstats.backlog -= qdisc_pkt_len(skb);

	return skb;
}

static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
{
	return __qdisc_dequeue_tail(sch, &sch->q);
}

static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
{
	return skb_peek(&sch->q);
}

/* generic pseudo peek method for non-work-conserving qdisc */
static inline struct sk_buff *qdisc_peek_dequeued(struct Qdisc *sch)
{
	/* we can reuse ->gso_skb because peek isn't called for root qdiscs */
	if (!sch->gso_skb) {
		sch->gso_skb = sch->dequeue(sch);
		if (sch->gso_skb)
			/* it's still part of the queue */
			sch->q.qlen++;
	}

	return sch->gso_skb;
}

/* use instead of qdisc->dequeue() for all qdiscs queried with ->peek() */
static inline struct sk_buff *qdisc_dequeue_peeked(struct Qdisc *sch)
{
	struct sk_buff *skb = sch->gso_skb;

	if (skb) {
		sch->gso_skb = NULL;
		sch->q.qlen--;
	} else {
		skb = sch->dequeue(sch);
	}

	return skb;
}

static inline void __qdisc_reset_queue(struct Qdisc *sch,
				       struct sk_buff_head *list)
{
	/*
	 * We do not know the backlog in bytes of this list, it
	 * is up to the caller to correct it
	 */
	__skb_queue_purge(list);
}

static inline void qdisc_reset_queue(struct Qdisc *sch)
{
	__qdisc_reset_queue(sch, &sch->q);
	sch->qstats.backlog = 0;
}

static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
					      struct sk_buff_head *list)
{
	struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);

	if (likely(skb != NULL)) {
		unsigned int len = qdisc_pkt_len(skb);
		kfree_skb(skb);
		return len;
	}

	return 0;
}

static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
{
	return __qdisc_queue_drop(sch, &sch->q);
}

static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
{
	kfree_skb(skb);
	sch->qstats.drops++;

	return NET_XMIT_DROP;
}

static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
{
	sch->qstats.drops++;

#ifdef CONFIG_NET_CLS_ACT
	if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
		goto drop;

	return NET_XMIT_SUCCESS;

drop:
#endif
	kfree_skb(skb);
	return NET_XMIT_DROP;
}

/* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
   long it will take to send a packet given its size.
 */
static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
{
	int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
	if (slot < 0)
		slot = 0;
	slot >>= rtab->rate.cell_log;
	if (slot > 255)
		return (rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF]);
	return rtab->data[slot];
}

#ifdef CONFIG_NET_CLS_ACT
static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask)
{
	struct sk_buff *n = skb_clone(skb, gfp_mask);

	if (n) {
		n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
		n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
		n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
	}
	return n;
}
#endif

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