aboutsummaryrefslogtreecommitdiffstats
path: root/net/sched/sch_sfq.c
diff options
context:
space:
mode:
authorEric Dumazet <eric.dumazet@gmail.com>2010-12-31 15:48:55 -0500
committerDavid S. Miller <davem@davemloft.net>2010-12-31 15:48:55 -0500
commit18c8d82ae5b802c5d82e0dfbcc08b1b568955f46 (patch)
tree6a9ff2bc889e63494b5636e9dbe8b8c9a5e296af /net/sched/sch_sfq.c
parenteeaeb068f1393b4db4861481bf594bcd1c3eda7a (diff)
sfq: fix slot_dequeue_head()
slot_dequeue_head() should make sure slot skb chain is correct in both ways, or we can crash if all possible flows are in use. Jarek pointed out slot_queue_init() can now be done in sfq_init() once, instead each time a flow is setup. Signed-off-by: Eric Dumazet <eric.dumazet@gmail.com> Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'net/sched/sch_sfq.c')
-rw-r--r--net/sched/sch_sfq.c6
1 files changed, 4 insertions, 2 deletions
diff --git a/net/sched/sch_sfq.c b/net/sched/sch_sfq.c
index b76d46b71466..d54ac94066c2 100644
--- a/net/sched/sch_sfq.c
+++ b/net/sched/sch_sfq.c
@@ -297,6 +297,7 @@ static inline struct sk_buff *slot_dequeue_head(struct sfq_slot *slot)
297 struct sk_buff *skb = slot->skblist_next; 297 struct sk_buff *skb = slot->skblist_next;
298 298
299 slot->skblist_next = skb->next; 299 slot->skblist_next = skb->next;
300 skb->next->prev = (struct sk_buff *)slot;
300 skb->next = skb->prev = NULL; 301 skb->next = skb->prev = NULL;
301 return skb; 302 return skb;
302} 303}
@@ -380,7 +381,6 @@ sfq_enqueue(struct sk_buff *skb, struct Qdisc *sch)
380 q->ht[hash] = x; 381 q->ht[hash] = x;
381 slot = &q->slots[x]; 382 slot = &q->slots[x];
382 slot->hash = hash; 383 slot->hash = hash;
383 slot_queue_init(slot);
384 } 384 }
385 385
386 /* If selected queue has length q->limit, do simple tail drop, 386 /* If selected queue has length q->limit, do simple tail drop,
@@ -545,8 +545,10 @@ static int sfq_init(struct Qdisc *sch, struct nlattr *opt)
545 return err; 545 return err;
546 } 546 }
547 547
548 for (i = 0; i < SFQ_SLOTS; i++) 548 for (i = 0; i < SFQ_SLOTS; i++) {
549 slot_queue_init(&q->slots[i]);
549 sfq_link(q, i); 550 sfq_link(q, i);
551 }
550 return 0; 552 return 0;
551} 553}
552 554