|
@@ -175,39 +175,10 @@ static void pneigh_queue_purge(struct sk_buff_head *list)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
-void neigh_changeaddr(struct neigh_table *tbl, struct net_device *dev)
|
|
|
-{
|
|
|
- int i;
|
|
|
-
|
|
|
- write_lock_bh(&tbl->lock);
|
|
|
-
|
|
|
- for (i=0; i <= tbl->hash_mask; i++) {
|
|
|
- struct neighbour *n, **np;
|
|
|
-
|
|
|
- np = &tbl->hash_buckets[i];
|
|
|
- while ((n = *np) != NULL) {
|
|
|
- if (dev && n->dev != dev) {
|
|
|
- np = &n->next;
|
|
|
- continue;
|
|
|
- }
|
|
|
- *np = n->next;
|
|
|
- write_lock_bh(&n->lock);
|
|
|
- n->dead = 1;
|
|
|
- neigh_del_timer(n);
|
|
|
- write_unlock_bh(&n->lock);
|
|
|
- neigh_release(n);
|
|
|
- }
|
|
|
- }
|
|
|
-
|
|
|
- write_unlock_bh(&tbl->lock);
|
|
|
-}
|
|
|
-
|
|
|
-int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
|
|
|
+static void neigh_flush_dev(struct neigh_table *tbl, struct net_device *dev)
|
|
|
{
|
|
|
int i;
|
|
|
|
|
|
- write_lock_bh(&tbl->lock);
|
|
|
-
|
|
|
for (i = 0; i <= tbl->hash_mask; i++) {
|
|
|
struct neighbour *n, **np = &tbl->hash_buckets[i];
|
|
|
|
|
@@ -243,7 +214,19 @@ int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
|
|
|
neigh_release(n);
|
|
|
}
|
|
|
}
|
|
|
+}
|
|
|
|
|
|
+void neigh_changeaddr(struct neigh_table *tbl, struct net_device *dev)
|
|
|
+{
|
|
|
+ write_lock_bh(&tbl->lock);
|
|
|
+ neigh_flush_dev(tbl, dev);
|
|
|
+ write_unlock_bh(&tbl->lock);
|
|
|
+}
|
|
|
+
|
|
|
+int neigh_ifdown(struct neigh_table *tbl, struct net_device *dev)
|
|
|
+{
|
|
|
+ write_lock_bh(&tbl->lock);
|
|
|
+ neigh_flush_dev(tbl, dev);
|
|
|
pneigh_ifdown(tbl, dev);
|
|
|
write_unlock_bh(&tbl->lock);
|
|
|
|