提交 1c265854 编写于 作者: K Kumar Sundararajan 提交者: David S. Miller

ipv6: fib: fix fib dump restart

When the ipv6 fib changes during a table dump, the walk is
restarted and the number of nodes dumped are skipped. But the existing
code doesn't advance to the next node after a node is skipped. This can
cause the dump to loop or produce lots of duplicates when the fib
is modified during the dump.

This change advances the walk to the next node if the current node is
skipped after a restart.
Signed-off-by: NKumar Sundararajan <kumar@fb.com>
Signed-off-by: NChris Mason <clm@fb.com>
Signed-off-by: NDavid S. Miller <davem@davemloft.net>
上级 fc5e8835
...@@ -1459,7 +1459,7 @@ static int fib6_walk_continue(struct fib6_walker_t *w) ...@@ -1459,7 +1459,7 @@ static int fib6_walk_continue(struct fib6_walker_t *w)
if (w->skip) { if (w->skip) {
w->skip--; w->skip--;
continue; goto skip;
} }
err = w->func(w); err = w->func(w);
...@@ -1469,6 +1469,7 @@ static int fib6_walk_continue(struct fib6_walker_t *w) ...@@ -1469,6 +1469,7 @@ static int fib6_walk_continue(struct fib6_walker_t *w)
w->count++; w->count++;
continue; continue;
} }
skip:
w->state = FWS_U; w->state = FWS_U;
case FWS_U: case FWS_U:
if (fn == w->root) if (fn == w->root)
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册