aboutsummaryrefslogtreecommitdiffstats
path: root/net
diff options
context:
space:
mode:
authorEric Dumazet <dada1@cosmosbay.com>2008-10-29 14:19:58 -0400
committerDavid S. Miller <davem@davemloft.net>2008-10-29 14:19:58 -0400
commit96631ed16c514cf8b28fab991a076985ce378c26 (patch)
tree60023b60c6eaf2acdc8fcad258585e4425ebaf91 /net
parentf52b5054ec108aaa9e903850d6b62af8ae3fe6ae (diff)
udp: introduce sk_for_each_rcu_safenext()
Corey Minyard found a race added in commit 271b72c7fa82c2c7a795bc16896149933110672d (udp: RCU handling for Unicast packets.) "If the socket is moved from one list to another list in-between the time the hash is calculated and the next field is accessed, and the socket has moved to the end of the new list, the traversal will not complete properly on the list it should have, since the socket will be on the end of the new list and there's not a way to tell it's on a new list and restart the list traversal. I think that this can be solved by pre-fetching the "next" field (with proper barriers) before checking the hash." This patch corrects this problem, introducing a new sk_for_each_rcu_safenext() macro. Signed-off-by: Eric Dumazet <dada1@cosmosbay.com> Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'net')
-rw-r--r--net/ipv4/udp.c4
-rw-r--r--net/ipv6/udp.c4
2 files changed, 4 insertions, 4 deletions
diff --git a/net/ipv4/udp.c b/net/ipv4/udp.c
index ced820318f94..c3ecec8a9e1c 100644
--- a/net/ipv4/udp.c
+++ b/net/ipv4/udp.c
@@ -256,7 +256,7 @@ static struct sock *__udp4_lib_lookup(struct net *net, __be32 saddr,
256 int dif, struct udp_table *udptable) 256 int dif, struct udp_table *udptable)
257{ 257{
258 struct sock *sk, *result; 258 struct sock *sk, *result;
259 struct hlist_node *node; 259 struct hlist_node *node, *next;
260 unsigned short hnum = ntohs(dport); 260 unsigned short hnum = ntohs(dport);
261 unsigned int hash = udp_hashfn(net, hnum); 261 unsigned int hash = udp_hashfn(net, hnum);
262 struct udp_hslot *hslot = &udptable->hash[hash]; 262 struct udp_hslot *hslot = &udptable->hash[hash];
@@ -266,7 +266,7 @@ static struct sock *__udp4_lib_lookup(struct net *net, __be32 saddr,
266begin: 266begin:
267 result = NULL; 267 result = NULL;
268 badness = -1; 268 badness = -1;
269 sk_for_each_rcu(sk, node, &hslot->head) { 269 sk_for_each_rcu_safenext(sk, node, &hslot->head, next) {
270 /* 270 /*
271 * lockless reader, and SLAB_DESTROY_BY_RCU items: 271 * lockless reader, and SLAB_DESTROY_BY_RCU items:
272 * We must check this item was not moved to another chain 272 * We must check this item was not moved to another chain
diff --git a/net/ipv6/udp.c b/net/ipv6/udp.c
index 1d9790e43dfc..32d914db6c4f 100644
--- a/net/ipv6/udp.c
+++ b/net/ipv6/udp.c
@@ -98,7 +98,7 @@ static struct sock *__udp6_lib_lookup(struct net *net,
98 int dif, struct udp_table *udptable) 98 int dif, struct udp_table *udptable)
99{ 99{
100 struct sock *sk, *result; 100 struct sock *sk, *result;
101 struct hlist_node *node; 101 struct hlist_node *node, *next;
102 unsigned short hnum = ntohs(dport); 102 unsigned short hnum = ntohs(dport);
103 unsigned int hash = udp_hashfn(net, hnum); 103 unsigned int hash = udp_hashfn(net, hnum);
104 struct udp_hslot *hslot = &udptable->hash[hash]; 104 struct udp_hslot *hslot = &udptable->hash[hash];
@@ -108,7 +108,7 @@ static struct sock *__udp6_lib_lookup(struct net *net,
108begin: 108begin:
109 result = NULL; 109 result = NULL;
110 badness = -1; 110 badness = -1;
111 sk_for_each_rcu(sk, node, &hslot->head) { 111 sk_for_each_rcu_safenext(sk, node, &hslot->head, next) {
112 /* 112 /*
113 * lockless reader, and SLAB_DESTROY_BY_RCU items: 113 * lockless reader, and SLAB_DESTROY_BY_RCU items:
114 * We must check this item was not moved to another chain 114 * We must check this item was not moved to another chain