net: sched: prio: delay destroying child qdiscs on change
Move destroying of the old child qdiscs outside of the sch_tree_lock() section. This should improve the software qdisc replace but is even more important for offloads. Calling offloads under a spin lock is best avoided, and child's destroy would be called under sch_tree_lock(). Signed-off-by: Jakub Kicinski <jakub.kicinski@netronome.com> Reviewed-by: John Hurley <john.hurley@netronome.com> Signed-off-by: David S. Miller <davem@davemloft.net>
This commit is contained in:
parent
0c8d13ac96
commit
7b8e0b6e65
|
@ -220,7 +220,6 @@ static int prio_tune(struct Qdisc *sch, struct nlattr *opt,
|
||||||
|
|
||||||
qdisc_tree_reduce_backlog(child, child->q.qlen,
|
qdisc_tree_reduce_backlog(child, child->q.qlen,
|
||||||
child->qstats.backlog);
|
child->qstats.backlog);
|
||||||
qdisc_put(child);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
for (i = oldbands; i < q->bands; i++) {
|
for (i = oldbands; i < q->bands; i++) {
|
||||||
|
@ -230,6 +229,9 @@ static int prio_tune(struct Qdisc *sch, struct nlattr *opt,
|
||||||
}
|
}
|
||||||
|
|
||||||
sch_tree_unlock(sch);
|
sch_tree_unlock(sch);
|
||||||
|
|
||||||
|
for (i = q->bands; i < oldbands; i++)
|
||||||
|
qdisc_put(q->queues[i]);
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue