提交 6f536936 编写于 作者: T Trond Myklebust

NFSv4.1/pNFS: Fix borken function _same_data_server_addrs_locked()

- Switch back to using list_for_each_entry(). Fixes an incorrect test
  for list NULL termination.
- Do not assume that lists are sorted.
- Finally, consider an existing entry to match if it consists of a subset
  of the addresses in the new entry.

Cc: stable@vger.kernel.org # 4.0+
Signed-off-by: NTrond Myklebust <trond.myklebust@primarydata.com>
上级 e9ae58ae
...@@ -359,26 +359,31 @@ same_sockaddr(struct sockaddr *addr1, struct sockaddr *addr2) ...@@ -359,26 +359,31 @@ same_sockaddr(struct sockaddr *addr1, struct sockaddr *addr2)
return false; return false;
} }
/*
* Checks if 'dsaddrs1' contains a subset of 'dsaddrs2'. If it does,
* declare a match.
*/
static bool static bool
_same_data_server_addrs_locked(const struct list_head *dsaddrs1, _same_data_server_addrs_locked(const struct list_head *dsaddrs1,
const struct list_head *dsaddrs2) const struct list_head *dsaddrs2)
{ {
struct nfs4_pnfs_ds_addr *da1, *da2; struct nfs4_pnfs_ds_addr *da1, *da2;
struct sockaddr *sa1, *sa2;
/* step through both lists, comparing as we go */ bool match = false;
for (da1 = list_first_entry(dsaddrs1, typeof(*da1), da_node),
da2 = list_first_entry(dsaddrs2, typeof(*da2), da_node); list_for_each_entry(da1, dsaddrs1, da_node) {
da1 != NULL && da2 != NULL; sa1 = (struct sockaddr *)&da1->da_addr;
da1 = list_entry(da1->da_node.next, typeof(*da1), da_node), match = false;
da2 = list_entry(da2->da_node.next, typeof(*da2), da_node)) { list_for_each_entry(da2, dsaddrs2, da_node) {
if (!same_sockaddr((struct sockaddr *)&da1->da_addr, sa2 = (struct sockaddr *)&da2->da_addr;
(struct sockaddr *)&da2->da_addr)) match = same_sockaddr(sa1, sa2);
return false; if (match)
break;
} }
if (da1 == NULL && da2 == NULL) if (!match)
return true; break;
}
return false; return match;
} }
/* /*
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册