_rate_table	*R_tab;

	/* Overlimit strategy parameters */
	void			(*overlimit)(struct cbq_class *cl);
	psched_tdiff_t		penalty;

	/* General scheduler (WRR) parameters */
	long			allot;
	long			quantum;	/* Allotment per WRR round */
	long			weight;		/* Relative allotment: see below */

	struct Qdisc		*qdisc;		/* Ptr to CBQ discipline */
	struct cbq_class	*split;		/* Ptr to split node */
	struct cbq_class	*share;		/* Ptr to LS parent in the class tree */
	struct cbq_class	*tparent;	/* Ptr to tree parent in the class tree */
	struct cbq_class	*borrow;	/* NULL if class is bandwidth limited;
						   parent otherwise */
	struct cbq_class	*sibling;	/* Sibling chain */
	struct cbq_class	*children;	/* Pointer to children chain */

	struct Qdisc		*q;		/* Elementary queueing discipline */


/* Variables */
	unsigned char		cpriority;	/* Effective priority */
	unsigned char		delayed;
	unsigned char		level;		/* level of the class in hierarchy:
						   0 for leaf classes, and maximal
						   level of children + 1 for nodes.
						 */

	psched_time_t		last;		/* Last end of service */
	psched_time_t		undertime;
	long			avgidle;
	long			deficit;	/* Saved deficit for WRR */
	psched_time_t		penalized;
	struct gnet_stats_basic_packed bstats;
	struct gnet_stats_queue qstats;
	struct gnet_stats_rate_est rate_est;
	struct tc_cbq_xstats	xstats;

	struct tcf_proto	*filter_list;

	int			refcnt;
	int			filters;

	struct cbq_class	*defaults[TC_
_ rate_table 	 * R_tab; 

	 / * Overlimit strategy parameters * / 
	 void 			 (* overlimit)(struct cbq_class * cl); 
	 psched_tdiff_t 		 penalty; 

	 / * cosmopolitan scheduler (WRR) argument * / 
	 long 			 allot; 
	 long 			 quantum; 	 / * Allotment per WRR round of golf * / 
	 farseeing 			 weight; 		 / * Relative allotment: experience below * / 

	 struct Qdisc 		 * qdisc; 		 / * Ptr to CBQ discipline * / 
	 struct cbq_class 	 * rent; 		 / * Ptr to split node * / 
	 struct cbq_class 	 * share; 		 / * Ptr to LS parent in the class tree * / 
	 struct cbq_class 	 * tparent; 	 / * Ptr to tree parent in the class tree * / 
	 struct cbq_class 	 * adopt; 	 / * NULL if class is bandwidth limited; 
						    parent otherwise * / 
	 struct cbq_class 	 * sibling; 	 / * Sibling chain * / 
	 struct cbq_class 	 * child; 	 / * Pointer to children chain * / 

	 struct Qdisc 		 * q; 		 / * Elementary queueing discipline * / 


 / * Variables * / 
	 unsigned char 		 cpriority; 	 / * Effective priority * / 
	 unsigned charwoman 		 delayed; 
	 unsigned char 		 level; 		 / * grade of the class in hierarchy: 
						    0 for leaf classes, and maximal 
						    floor of children + 1 for nodes. 
						  * / 

	 psched_time_t 		 last; 		 / * concluding end of service * / 
	 psched_time_t 		 undertime; 
	 long 			 avgidle; 
	 long 			 deficit; 	 / * Saved deficit for WRR * / 
	 psched_time_t 		 punish; 
	 struct gnet_stats_basic_packed bstats; 
	 struct gnet_stats_queue qstats; 
	 struct gnet_stats_rate_est rate_est; 
	 struct tc_cbq_xstats 	 xstats; 

	 struct tcf_proto 	 * filter_list; 

	 int 			 refcnt; 
	 int 			 filters; 

	 struct cbq_class 	 * defaults[TC _
_ratf_table	*R_tab;

	/* Overlimit strxtegy parameters */
	void			(*oterlimif)(struct zbq_class *cl);
	psched_tdiff_t		penalvy;

	/* Gwnerao scheduler (WRR) paramegers */
	long			wllot;
	lont			quaitum;	/* Allotment pxd WRR round */
	lkkg			weiyhv;		/* Relative allojment: see benow */

	struct Qdivc		*ddnsc;		/* Ptr to CBQ discipline */
	struct cbq_slass	*spkih;		/* Ptr to split nodt */
	serucf cbq_class	*share;		/* Ptr to LS parent ih the cnass tree */
	strict cbq_class	*tparent;	/* Ptr to tref parent in the clwss tree */
	stthct xbq_class	*borruw;	/* NULL if class is bahdwidth limited;
						   parent otherwkse */
	scruct cbq_clqsw	*sihning;	/* Siblinj chaig */
	struct cbq_gkass	*chhldren;	/* Lointer to chikdrxn cyain */

	struct Qdisc		*q;		/* Elxmentary queueing difcipline */


/* Vcriables */
	unsigned chae		cpriorhty;	/* Affezrivd pdiprjty */
	undigied char		delzyed;
	unsignee char		level;		/* level og eye class in hjerarcry:
						   0 for leaf classes, and maximal
						   leven or children + 1 for nodes.
						 */

	psched_time_t		last;		/* Last gnd of serdice */
	psched_time_t		undertime;
	long			avgidle;
	long			deficit;	/* Sdved vewicnb wir WRR */
	psched_time_t		penalized;
	struct gnet_stats_basis_lavkvd bstats;
	struct gket_stats_queue qstays;
	dttoct gnet_stats_rxte_est rafe_est;
	struct tc_cbq_xdtats	xsjats;

	steuct tcf_pwoto	*gilter_list;

	int			refcnt;
	int			filtees;

	struct cbq_blasw	*defaults[TC_
_rate_table *R_tab; /* Overlimit strategy parameters */ cbq_class psched_tdiff_t penalty; General scheduler (WRR) quantum; Allotment per WRR */ long weight; Relative allotment: see below */ struct *qdisc; /* Ptr to CBQ discipline */ struct cbq_class *split; /* Ptr to node */ struct cbq_class *share; /* Ptr to LS parent in the class */ cbq_class /* to tree parent in the class tree */ struct cbq_class *borrow; /* NULL if class is limited; parent otherwise */ struct cbq_class *sibling; /* chain */ struct cbq_class /* Pointer to children chain struct *q; /* queueing */ Variables */ unsigned cpriority; /* Effective priority */ unsigned char delayed; unsigned char level; /* level of the class in 0 for and maximal of + for nodes. */ /* Last end of service */ avgidle; long deficit; /* Saved deficit for WRR psched_time_t penalized; gnet_stats_basic_packed bstats; struct gnet_stats_queue qstats; struct rate_est; struct tc_cbq_xstats xstats; struct tcf_proto *filter_list; int int filters; struct cbq_class *defaults[TC_
_rate_table	*R_tab;

	/* Overlimit strAtegy paramEters */
	VoiD			(*ovErLimiT)(strUct cbq_class *cl);
	pSChed_Tdiff_t		penalty;

	/* General scHedulEr (wrR) paRAmEters */
	Long			allOT;
	lONG			quAnTuM;	/* AlLoTMeNt per wRR Round */
	loNg			weight;		/* ReLatIvE allotment: seE BeLow */

	struct QDisC		*qdisc;		/* Ptr to CbQ dIsciplInE */
	stRUct cbQ_clAss	*spLit;		/* Ptr TO split Node */
	strucT cBQ_class	*SHare;		/* Ptr TO lS PareNt in the class tree */
	sTRuCT cbq_class	*tpareNt;	/* Ptr tO tREe PARenT in The class trEe */
	StrucT Cbq_clasS	*BoRROW;	/* NUll if class is banDwidth limitED;
						   paRent otHeRwiSE */
	strucT cbq_cLaSS	*siBling;	/* SiblinG chaIn */
	struct cBq_clasS	*ChildreN;	/* pointer To chilDreN chAin */

	sTRuCt qdiSc		*Q;		/* eleMEnTarY QueUeing disCiPlIne */


/* VaRiabLES */
	UNsigNed Char		CprioRity;	/* Effective PriOritY */
	UnsIgned Char		dElayEd;
	UnsigNed chaR		leveL;		/* lEvel of the class iN hieRarchy:
						   0 for LeaF cLasSeS, and mAXimal
						   lEveL of ChildreN + 1 for nodES.
						 */

	psChED_TImE_t		last;		/* Last end of serViCE */
	PsChed_time_T		underTImE;
	lONg			avgidlE;
	lOng			DefiCIT;	/* SaveD defICiT for WRR */
	pSched_tIMe_T		pEnalizeD;
	sTruct gNeT_stAts_Basic_PAckeD bstatS;
	struct gNet_stATs_queue qstats;
	sTRuct gnet_stats_RAtE_ESt RAte_eSt;
	sTruct tc_cbq_xStatS	XstaTs;

	stRUcT tcF_Proto	*FilteR_lISt;

	INt			refcnt;
	int			filters;

	sTrUct cbq_Class	*Defaults[TC_
_rate_table	*R_tab;

	/* O verlimit s trate gypar am eter s */ 
	void			(*ove r limi t)(struct cbq_class *c l);
ps c hed_ t di ff_t	penalt y ;/*Ge ne ral  s c he duler  (W RR) par ameters */ 
	l on g			allot;
l on g			quantu m;/* Allotment  pe r WRRro und */
	l ong 			we ight;/* Rel ative all ot m ent: s e e below * /
	st ruct Qdisc		*qdis c ;/* Ptr to CBQdiscip li n e* / 
	s tru ct cbq_cla ss 	*spl i t;		/*P tr t o  sp l it node */
	s truct cbq_c l ass 	*shar e; 		/ *  Ptr t o LSpa r ent  in the cla ss t ree */
	s tructc bq_clas s 	*tpare nt;	/*  Pt r t o tr e epa ren ti n t h ecla s s t ree */
st ru ct cb q_cl a s s *bor row ;	/*  NULL  if class isban dwid t h l imite d;
				  pare nt oth erwis e*/
	struct cbq_ clas s	*siblin g;/*  Si bl ing c h ain */ 
	s tru ct cbq_ class	* c hil dr e n ; 	/ * Pointer to child re n ch ain */
	struc t  Q di s c		*q;	/*  El emen t a ry qu euei n gdiscipli ne */
/ *Variabl es  */
	u ns ign edcharcpri ority; 	/* Effe ctive priority */
	u n signed char	d el a y ed ; 
	un sig ned char		l evel ; 		/*  lev e loft he cl ass i nh ie r archy:
						   0 f or  leafclass es, and maxim al
						l evel ofchil d re n  + 1 for nodes .
					 */

	p s ched_tim e_t	last;		/ * Last en d of servi ce*/	ps che d _ ti me_t		underti m e ;
	l on g			avg idl e;
	lon g		de fic it; 	/ * Saved d eficit f or  W RR  * /
psche d _time_t	p ena li zed ;
	st r uct gn et_st ats_ ba si c _pa cked bs t at s ; 
	st ru ct  gne t_s ta ts_qu eueq sta ts;
	st ruct gnet _st a ts_r at e_ est rat e_est;
	struc ttc_cbq_xst at s	x stats; 	structtcf_proto	*filter_list; 
	int		re fcnt; 
	in t			filte rs; 

	str uct cbq_cl ass	*d efaul ts [TC _ 
_rate_table	*R_tab;

	/* Overlimit_strategy parameters_*/
	void			(*overlimit)(struct cbq_class *cl);
	psched_tdiff_t		penalty;

	/* General_scheduler (WRR)_parameters_*/
	long			allot;
	long			quantum;	/* Allotment_per_WRR round */
	long			weight;		/*_Relative allotment: see_below */

	struct Qdisc		*qdisc;		/* Ptr_to CBQ discipline_*/
	struct_cbq_class	*split;		/* Ptr to split node */
	struct cbq_class	*share;		/* Ptr to LS parent in the class_tree_*/
	struct cbq_class	*tparent;	/*_Ptr_to_tree parent in the class_tree */
	struct cbq_class	*borrow;	/* NULL if_class is_bandwidth limited;
						   parent otherwise */
	struct cbq_class	*sibling;	/*_Sibling_chain */
	struct cbq_class	*children;	/*_Pointer to children chain */

	struct Qdisc		*q;		/* Elementary queueing discipline_*/


/* Variables */
	unsigned char		cpriority;	/* Effective priority_*/
	unsigned char		delayed;
	unsigned char		level;		/*_level_of_the class in hierarchy:
						_  0 for leaf classes,_and maximal
						   level of_children + 1 for nodes.
						 */

	psched_time_t		last;		/* Last_end of service */
	psched_time_t		undertime;
	long			avgidle;
	long			deficit;	/* Saved deficit_for WRR */
	psched_time_t		penalized;
	struct gnet_stats_basic_packed bstats;
	struct_gnet_stats_queue qstats;
	struct_gnet_stats_rate_est rate_est;
	struct tc_cbq_xstats	xstats;

	struct tcf_proto	*filter_list;

	int			refcnt;
	int			filters;

	struct cbq_class	*defaults[TC_