LARTC - Jun 2004 - Help:how to generate different packets?souce code explanation?

Hi,All
	I setup traffic control configuration with HTB this way:

					1: root HTB qdisc
     						 |
				1:1 HTB class  rate 1024kbit
     						 |
 				 /-----+-----+-----+------+-----\
				1:10  1:20  1:30  1:40   1:50    1:60
				EF	  AF41   AF31  AF21   AF11   BE

     and alloct different bandwidth to these PHBs(queues).So which tool would I
use to generate these packets at the same to for testing?Thank you!
	Another question:I am studying sch_htb.c,but it's so tough for to
understand,especially htb_dequeue().Would anyone please supply some adivse?
	Thank you very much!
	

　　Best regards.
 				

　　　　　　　　swcims
　　　　　　　　swcims@163.com
　　　　　　　　　　2004-06-18

>	Another question:I am studying sch_htb.c,but it''s so tough for to
understand,especially htb_dequeue().Would anyone please supply some adivse?
>  
>
Hmm, well I will set you a problem. I have been looking at sch_htb.c as
well, but I don''t understand the marked line below (won''t it
mean that
we double count the stats for this packet?):


static int htb_enqueue(struct sk_buff *skb, struct Qdisc *sch)
{
struct htb_sched *q = (struct htb_sched *)sch->data;
struct htb_class *cl = htb_classify(skb,sch);

if (cl == HTB_DIRECT || !cl) {
/* enqueue to helper queue */
if (q->direct_queue.qlen < q->direct_qlen && cl) {
__skb_queue_tail(&q->direct_queue, skb);
q->direct_pkts++;
} else {
kfree_skb (skb);
sch->stats.drops++;
return NET_XMIT_DROP;
}
} else if (cl->un.leaf.q->enqueue(skb, cl->un.leaf.q) !=
NET_XMIT_SUCCESS) {
sch->stats.drops++;
cl->stats.drops++;
return NET_XMIT_DROP;
} else {
->> cl->stats.packets++; cl->stats.bytes += skb->len;
htb_activate (q,cl);
}

sch->q.qlen++;
sch->stats.packets++; sch->stats.bytes += skb->len;
HTB_DBG(1,1,"htb_enq_ok cl=%X skb=%p\n",(cl && cl
!HTB_DIRECT)?cl->classid:0,skb);
return NET_XMIT_SUCCESS;
}


_______________________________________________
LARTC mailing list / LARTC@mailman.ds9a.nl
http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/