patch-2.4.21 linux-2.4.21/net/sched/sch_csz.c

• Lines: 24
• Date: 2003-06-13 07:51:39.000000000 -0700
• Orig file: linux-2.4.20/net/sched/sch_csz.c
• Orig date: 2001-12-21 09:42:06.000000000 -0800

diff -urN linux-2.4.20/net/sched/sch_csz.c linux-2.4.21/net/sched/sch_csz.c
@@ -56,7 +56,7 @@
 	CSZ presents a more precise but less flexible and less efficient
 	approach. As I understand it, the main idea is to create
 	WFQ flows for each guaranteed service and to allocate
-	the rest of bandwith to dummy flow-0. Flow-0 comprises
+	the rest of bandwidth to dummy flow-0. Flow-0 comprises
 	the predictive services and the best effort traffic;
 	it is handled by a priority scheduler with the highest
 	priority band allocated	for predictive services, and the rest ---
@@ -749,6 +749,14 @@
 static void
 csz_destroy(struct Qdisc* sch)
 {
+	struct csz_sched_data *q = (struct csz_sched_data *)sch->data;
+	struct tcf_proto *tp;
+
+	while ((tp = q->filter_list) != NULL) {
+		q->filter_list = tp->next;
+		tp->ops->destroy(tp);
+	}
+
 	MOD_DEC_USE_COUNT;
 }