[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-Id: <1477463962-2802-1-git-send-email-idosch@idosch.org>
Date: Wed, 26 Oct 2016 09:39:22 +0300
From: idosch@...sch.org
To: davem@...emloft.net
Cc: netdev@...r.kernel.org, mlxsw@...lanox.com,
dsa@...ulusnetworks.com, Ido Schimmel <idosch@...lanox.com>
Subject: [PATCH net-next] net: core: Traverse the adjacency list from first entry
From: Ido Schimmel <idosch@...lanox.com>
netdev_next_lower_dev() returns NULL when we finished traversing the
adjacency list ('iter' points to the list's head). Therefore, we must
start traversing the list from the first entry and not its head.
Fixes: 1a3f060c1a47 ("net: Introduce new api for walking upper and lower devices")
Signed-off-by: Ido Schimmel <idosch@...lanox.com>
---
net/core/dev.c | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/net/core/dev.c b/net/core/dev.c
index f55fb45..d9c937f 100644
--- a/net/core/dev.c
+++ b/net/core/dev.c
@@ -5419,7 +5419,7 @@ int netdev_walk_all_lower_dev(struct net_device *dev,
struct list_head *iter;
int ret;
- for (iter = &dev->adj_list.lower,
+ for (iter = dev->adj_list.lower.next,
ldev = netdev_next_lower_dev(dev, &iter);
ldev;
ldev = netdev_next_lower_dev(dev, &iter)) {
--
2.7.4
Powered by blists - more mailing lists