]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * INET An implementation of the TCP/IP protocol suite for the LINUX | |
3 | * operating system. INET is implemented using the BSD Socket | |
4 | * interface as the means of communication with the user level. | |
5 | * | |
6 | * The User Datagram Protocol (UDP). | |
7 | * | |
02c30a84 | 8 | * Authors: Ross Biro |
1da177e4 LT |
9 | * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG> |
10 | * Arnt Gulbrandsen, <agulbra@nvg.unit.no> | |
113aa838 | 11 | * Alan Cox, <alan@lxorguk.ukuu.org.uk> |
1da177e4 LT |
12 | * Hirokazu Takahashi, <taka@valinux.co.jp> |
13 | * | |
14 | * Fixes: | |
15 | * Alan Cox : verify_area() calls | |
16 | * Alan Cox : stopped close while in use off icmp | |
17 | * messages. Not a fix but a botch that | |
18 | * for udp at least is 'valid'. | |
19 | * Alan Cox : Fixed icmp handling properly | |
20 | * Alan Cox : Correct error for oversized datagrams | |
e905a9ed YH |
21 | * Alan Cox : Tidied select() semantics. |
22 | * Alan Cox : udp_err() fixed properly, also now | |
1da177e4 LT |
23 | * select and read wake correctly on errors |
24 | * Alan Cox : udp_send verify_area moved to avoid mem leak | |
25 | * Alan Cox : UDP can count its memory | |
26 | * Alan Cox : send to an unknown connection causes | |
27 | * an ECONNREFUSED off the icmp, but | |
28 | * does NOT close. | |
29 | * Alan Cox : Switched to new sk_buff handlers. No more backlog! | |
30 | * Alan Cox : Using generic datagram code. Even smaller and the PEEK | |
31 | * bug no longer crashes it. | |
32 | * Fred Van Kempen : Net2e support for sk->broadcast. | |
33 | * Alan Cox : Uses skb_free_datagram | |
34 | * Alan Cox : Added get/set sockopt support. | |
35 | * Alan Cox : Broadcasting without option set returns EACCES. | |
36 | * Alan Cox : No wakeup calls. Instead we now use the callbacks. | |
37 | * Alan Cox : Use ip_tos and ip_ttl | |
38 | * Alan Cox : SNMP Mibs | |
39 | * Alan Cox : MSG_DONTROUTE, and 0.0.0.0 support. | |
40 | * Matt Dillon : UDP length checks. | |
41 | * Alan Cox : Smarter af_inet used properly. | |
42 | * Alan Cox : Use new kernel side addressing. | |
43 | * Alan Cox : Incorrect return on truncated datagram receive. | |
44 | * Arnt Gulbrandsen : New udp_send and stuff | |
45 | * Alan Cox : Cache last socket | |
46 | * Alan Cox : Route cache | |
47 | * Jon Peatfield : Minor efficiency fix to sendto(). | |
48 | * Mike Shaver : RFC1122 checks. | |
49 | * Alan Cox : Nonblocking error fix. | |
50 | * Willy Konynenberg : Transparent proxying support. | |
51 | * Mike McLagan : Routing by source | |
52 | * David S. Miller : New socket lookup architecture. | |
53 | * Last socket cache retained as it | |
54 | * does have a high hit rate. | |
55 | * Olaf Kirch : Don't linearise iovec on sendmsg. | |
56 | * Andi Kleen : Some cleanups, cache destination entry | |
e905a9ed | 57 | * for connect. |
1da177e4 LT |
58 | * Vitaly E. Lavrov : Transparent proxy revived after year coma. |
59 | * Melvin Smith : Check msg_name not msg_namelen in sendto(), | |
60 | * return ENOTCONN for unconnected sockets (POSIX) | |
61 | * Janos Farkas : don't deliver multi/broadcasts to a different | |
62 | * bound-to-device socket | |
63 | * Hirokazu Takahashi : HW checksumming for outgoing UDP | |
64 | * datagrams. | |
65 | * Hirokazu Takahashi : sendfile() on UDP works now. | |
66 | * Arnaldo C. Melo : convert /proc/net/udp to seq_file | |
67 | * YOSHIFUJI Hideaki @USAGI and: Support IPV6_V6ONLY socket option, which | |
68 | * Alexey Kuznetsov: allow both IPv4 and IPv6 sockets to bind | |
69 | * a single port at the same time. | |
70 | * Derek Atkins <derek@ihtfp.com>: Add Encapulation Support | |
342f0234 | 71 | * James Chapman : Add L2TP encapsulation type. |
1da177e4 LT |
72 | * |
73 | * | |
74 | * This program is free software; you can redistribute it and/or | |
75 | * modify it under the terms of the GNU General Public License | |
76 | * as published by the Free Software Foundation; either version | |
77 | * 2 of the License, or (at your option) any later version. | |
78 | */ | |
e905a9ed | 79 | |
1da177e4 LT |
80 | #include <asm/system.h> |
81 | #include <asm/uaccess.h> | |
82 | #include <asm/ioctls.h> | |
95766fff | 83 | #include <linux/bootmem.h> |
8203efb3 ED |
84 | #include <linux/highmem.h> |
85 | #include <linux/swap.h> | |
1da177e4 LT |
86 | #include <linux/types.h> |
87 | #include <linux/fcntl.h> | |
88 | #include <linux/module.h> | |
89 | #include <linux/socket.h> | |
90 | #include <linux/sockios.h> | |
14c85021 | 91 | #include <linux/igmp.h> |
1da177e4 LT |
92 | #include <linux/in.h> |
93 | #include <linux/errno.h> | |
94 | #include <linux/timer.h> | |
95 | #include <linux/mm.h> | |
1da177e4 | 96 | #include <linux/inet.h> |
1da177e4 | 97 | #include <linux/netdevice.h> |
c752f073 | 98 | #include <net/tcp_states.h> |
1da177e4 LT |
99 | #include <linux/skbuff.h> |
100 | #include <linux/proc_fs.h> | |
101 | #include <linux/seq_file.h> | |
457c4cbc | 102 | #include <net/net_namespace.h> |
1da177e4 LT |
103 | #include <net/icmp.h> |
104 | #include <net/route.h> | |
1da177e4 LT |
105 | #include <net/checksum.h> |
106 | #include <net/xfrm.h> | |
ba4e58ec | 107 | #include "udp_impl.h" |
1da177e4 | 108 | |
645ca708 ED |
109 | struct udp_table udp_table; |
110 | EXPORT_SYMBOL(udp_table); | |
1da177e4 | 111 | |
95766fff HA |
112 | int sysctl_udp_mem[3] __read_mostly; |
113 | int sysctl_udp_rmem_min __read_mostly; | |
114 | int sysctl_udp_wmem_min __read_mostly; | |
115 | ||
116 | EXPORT_SYMBOL(sysctl_udp_mem); | |
117 | EXPORT_SYMBOL(sysctl_udp_rmem_min); | |
118 | EXPORT_SYMBOL(sysctl_udp_wmem_min); | |
119 | ||
120 | atomic_t udp_memory_allocated; | |
121 | EXPORT_SYMBOL(udp_memory_allocated); | |
122 | ||
f24d43c0 | 123 | static int udp_lib_lport_inuse(struct net *net, __u16 num, |
645ca708 | 124 | const struct udp_hslot *hslot, |
f24d43c0 ED |
125 | struct sock *sk, |
126 | int (*saddr_comp)(const struct sock *sk1, | |
127 | const struct sock *sk2)) | |
1da177e4 | 128 | { |
f24d43c0 | 129 | struct sock *sk2; |
1da177e4 | 130 | struct hlist_node *node; |
25030a7f | 131 | |
645ca708 | 132 | sk_for_each(sk2, node, &hslot->head) |
f24d43c0 ED |
133 | if (net_eq(sock_net(sk2), net) && |
134 | sk2 != sk && | |
135 | sk2->sk_hash == num && | |
136 | (!sk2->sk_reuse || !sk->sk_reuse) && | |
137 | (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if | |
138 | || sk2->sk_bound_dev_if == sk->sk_bound_dev_if) && | |
139 | (*saddr_comp)(sk, sk2)) | |
25030a7f GR |
140 | return 1; |
141 | return 0; | |
142 | } | |
143 | ||
144 | /** | |
6ba5a3c5 | 145 | * udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6 |
25030a7f GR |
146 | * |
147 | * @sk: socket struct in question | |
148 | * @snum: port number to look up | |
df2bc459 | 149 | * @saddr_comp: AF-dependent comparison of bound local IP addresses |
25030a7f | 150 | */ |
6ba5a3c5 | 151 | int udp_lib_get_port(struct sock *sk, unsigned short snum, |
df2bc459 DM |
152 | int (*saddr_comp)(const struct sock *sk1, |
153 | const struct sock *sk2 ) ) | |
25030a7f | 154 | { |
645ca708 ED |
155 | struct udp_hslot *hslot; |
156 | struct udp_table *udptable = sk->sk_prot->h.udp_table; | |
25030a7f | 157 | int error = 1; |
3b1e0a65 | 158 | struct net *net = sock_net(sk); |
1da177e4 | 159 | |
32c1da70 | 160 | if (!snum) { |
9088c560 ED |
161 | int low, high, remaining; |
162 | unsigned rand; | |
163 | unsigned short first; | |
32c1da70 | 164 | |
227b60f5 | 165 | inet_get_local_port_range(&low, &high); |
a25de534 | 166 | remaining = (high - low) + 1; |
227b60f5 | 167 | |
9088c560 ED |
168 | rand = net_random(); |
169 | snum = first = rand % remaining + low; | |
170 | rand |= 1; | |
645ca708 ED |
171 | for (;;) { |
172 | hslot = &udptable->hash[udp_hashfn(net, snum)]; | |
173 | spin_lock_bh(&hslot->lock); | |
174 | if (!udp_lib_lport_inuse(net, snum, hslot, sk, saddr_comp)) | |
175 | break; | |
176 | spin_unlock_bh(&hslot->lock); | |
9088c560 ED |
177 | do { |
178 | snum = snum + rand; | |
179 | } while (snum < low || snum > high); | |
180 | if (snum == first) | |
181 | goto fail; | |
1da177e4 | 182 | } |
645ca708 ED |
183 | } else { |
184 | hslot = &udptable->hash[udp_hashfn(net, snum)]; | |
185 | spin_lock_bh(&hslot->lock); | |
186 | if (udp_lib_lport_inuse(net, snum, hslot, sk, saddr_comp)) | |
187 | goto fail_unlock; | |
188 | } | |
25030a7f | 189 | inet_sk(sk)->num = snum; |
df2bc459 | 190 | sk->sk_hash = snum; |
1da177e4 | 191 | if (sk_unhashed(sk)) { |
c37ccc0d ED |
192 | /* |
193 | * We need that previous write to sk->sk_hash committed | |
194 | * before write to sk->next done in following add_node() variant | |
195 | */ | |
196 | smp_wmb(); | |
271b72c7 | 197 | sk_add_node_rcu(sk, &hslot->head); |
c29a0bc4 | 198 | sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1); |
1da177e4 | 199 | } |
25030a7f | 200 | error = 0; |
645ca708 ED |
201 | fail_unlock: |
202 | spin_unlock_bh(&hslot->lock); | |
1da177e4 | 203 | fail: |
25030a7f GR |
204 | return error; |
205 | } | |
206 | ||
6ba5a3c5 | 207 | static int ipv4_rcv_saddr_equal(const struct sock *sk1, const struct sock *sk2) |
db8dac20 DM |
208 | { |
209 | struct inet_sock *inet1 = inet_sk(sk1), *inet2 = inet_sk(sk2); | |
210 | ||
211 | return ( !ipv6_only_sock(sk2) && | |
212 | (!inet1->rcv_saddr || !inet2->rcv_saddr || | |
213 | inet1->rcv_saddr == inet2->rcv_saddr )); | |
214 | } | |
215 | ||
6ba5a3c5 | 216 | int udp_v4_get_port(struct sock *sk, unsigned short snum) |
db8dac20 | 217 | { |
6ba5a3c5 | 218 | return udp_lib_get_port(sk, snum, ipv4_rcv_saddr_equal); |
db8dac20 DM |
219 | } |
220 | ||
645ca708 ED |
221 | static inline int compute_score(struct sock *sk, struct net *net, __be32 saddr, |
222 | unsigned short hnum, | |
223 | __be16 sport, __be32 daddr, __be16 dport, int dif) | |
224 | { | |
225 | int score = -1; | |
226 | ||
227 | if (net_eq(sock_net(sk), net) && sk->sk_hash == hnum && | |
228 | !ipv6_only_sock(sk)) { | |
229 | struct inet_sock *inet = inet_sk(sk); | |
230 | ||
231 | score = (sk->sk_family == PF_INET ? 1 : 0); | |
232 | if (inet->rcv_saddr) { | |
233 | if (inet->rcv_saddr != daddr) | |
234 | return -1; | |
235 | score += 2; | |
236 | } | |
237 | if (inet->daddr) { | |
238 | if (inet->daddr != saddr) | |
239 | return -1; | |
240 | score += 2; | |
241 | } | |
242 | if (inet->dport) { | |
243 | if (inet->dport != sport) | |
244 | return -1; | |
245 | score += 2; | |
246 | } | |
247 | if (sk->sk_bound_dev_if) { | |
248 | if (sk->sk_bound_dev_if != dif) | |
249 | return -1; | |
250 | score += 2; | |
251 | } | |
252 | } | |
253 | return score; | |
254 | } | |
255 | ||
db8dac20 DM |
256 | /* UDP is nearly always wildcards out the wazoo, it makes no sense to try |
257 | * harder than this. -DaveM | |
258 | */ | |
259 | static struct sock *__udp4_lib_lookup(struct net *net, __be32 saddr, | |
260 | __be16 sport, __be32 daddr, __be16 dport, | |
645ca708 | 261 | int dif, struct udp_table *udptable) |
db8dac20 | 262 | { |
271b72c7 | 263 | struct sock *sk, *result; |
96631ed1 | 264 | struct hlist_node *node, *next; |
db8dac20 | 265 | unsigned short hnum = ntohs(dport); |
645ca708 ED |
266 | unsigned int hash = udp_hashfn(net, hnum); |
267 | struct udp_hslot *hslot = &udptable->hash[hash]; | |
271b72c7 | 268 | int score, badness; |
645ca708 | 269 | |
271b72c7 ED |
270 | rcu_read_lock(); |
271 | begin: | |
272 | result = NULL; | |
273 | badness = -1; | |
96631ed1 | 274 | sk_for_each_rcu_safenext(sk, node, &hslot->head, next) { |
271b72c7 ED |
275 | /* |
276 | * lockless reader, and SLAB_DESTROY_BY_RCU items: | |
277 | * We must check this item was not moved to another chain | |
278 | */ | |
279 | if (udp_hashfn(net, sk->sk_hash) != hash) | |
280 | goto begin; | |
645ca708 ED |
281 | score = compute_score(sk, net, saddr, hnum, sport, |
282 | daddr, dport, dif); | |
283 | if (score > badness) { | |
284 | result = sk; | |
285 | badness = score; | |
db8dac20 DM |
286 | } |
287 | } | |
271b72c7 ED |
288 | if (result) { |
289 | if (unlikely(!atomic_inc_not_zero(&result->sk_refcnt))) | |
290 | result = NULL; | |
291 | else if (unlikely(compute_score(result, net, saddr, hnum, sport, | |
292 | daddr, dport, dif) < badness)) { | |
293 | sock_put(result); | |
294 | goto begin; | |
295 | } | |
296 | } | |
297 | rcu_read_unlock(); | |
db8dac20 DM |
298 | return result; |
299 | } | |
300 | ||
607c4aaf KK |
301 | static inline struct sock *__udp4_lib_lookup_skb(struct sk_buff *skb, |
302 | __be16 sport, __be16 dport, | |
645ca708 | 303 | struct udp_table *udptable) |
607c4aaf | 304 | { |
23542618 | 305 | struct sock *sk; |
607c4aaf KK |
306 | const struct iphdr *iph = ip_hdr(skb); |
307 | ||
23542618 KK |
308 | if (unlikely(sk = skb_steal_sock(skb))) |
309 | return sk; | |
310 | else | |
311 | return __udp4_lib_lookup(dev_net(skb->dst->dev), iph->saddr, sport, | |
312 | iph->daddr, dport, inet_iif(skb), | |
313 | udptable); | |
607c4aaf KK |
314 | } |
315 | ||
bcd41303 KK |
316 | struct sock *udp4_lib_lookup(struct net *net, __be32 saddr, __be16 sport, |
317 | __be32 daddr, __be16 dport, int dif) | |
318 | { | |
645ca708 | 319 | return __udp4_lib_lookup(net, saddr, sport, daddr, dport, dif, &udp_table); |
bcd41303 KK |
320 | } |
321 | EXPORT_SYMBOL_GPL(udp4_lib_lookup); | |
322 | ||
920a4611 | 323 | static inline struct sock *udp_v4_mcast_next(struct net *net, struct sock *sk, |
db8dac20 DM |
324 | __be16 loc_port, __be32 loc_addr, |
325 | __be16 rmt_port, __be32 rmt_addr, | |
326 | int dif) | |
327 | { | |
328 | struct hlist_node *node; | |
329 | struct sock *s = sk; | |
330 | unsigned short hnum = ntohs(loc_port); | |
331 | ||
332 | sk_for_each_from(s, node) { | |
333 | struct inet_sock *inet = inet_sk(s); | |
334 | ||
920a4611 ED |
335 | if (!net_eq(sock_net(s), net) || |
336 | s->sk_hash != hnum || | |
db8dac20 DM |
337 | (inet->daddr && inet->daddr != rmt_addr) || |
338 | (inet->dport != rmt_port && inet->dport) || | |
339 | (inet->rcv_saddr && inet->rcv_saddr != loc_addr) || | |
340 | ipv6_only_sock(s) || | |
341 | (s->sk_bound_dev_if && s->sk_bound_dev_if != dif)) | |
342 | continue; | |
343 | if (!ip_mc_sf_allow(s, loc_addr, rmt_addr, dif)) | |
344 | continue; | |
345 | goto found; | |
346 | } | |
347 | s = NULL; | |
348 | found: | |
349 | return s; | |
350 | } | |
351 | ||
352 | /* | |
353 | * This routine is called by the ICMP module when it gets some | |
354 | * sort of error condition. If err < 0 then the socket should | |
355 | * be closed and the error returned to the user. If err > 0 | |
356 | * it's just the icmp type << 8 | icmp code. | |
357 | * Header points to the ip header of the error packet. We move | |
358 | * on past this. Then (as it used to claim before adjustment) | |
359 | * header points to the first 8 bytes of the udp header. We need | |
360 | * to find the appropriate port. | |
361 | */ | |
362 | ||
645ca708 | 363 | void __udp4_lib_err(struct sk_buff *skb, u32 info, struct udp_table *udptable) |
db8dac20 DM |
364 | { |
365 | struct inet_sock *inet; | |
366 | struct iphdr *iph = (struct iphdr*)skb->data; | |
367 | struct udphdr *uh = (struct udphdr*)(skb->data+(iph->ihl<<2)); | |
368 | const int type = icmp_hdr(skb)->type; | |
369 | const int code = icmp_hdr(skb)->code; | |
370 | struct sock *sk; | |
371 | int harderr; | |
372 | int err; | |
fd54d716 | 373 | struct net *net = dev_net(skb->dev); |
db8dac20 | 374 | |
fd54d716 | 375 | sk = __udp4_lib_lookup(net, iph->daddr, uh->dest, |
db8dac20 DM |
376 | iph->saddr, uh->source, skb->dev->ifindex, udptable); |
377 | if (sk == NULL) { | |
dcfc23ca | 378 | ICMP_INC_STATS_BH(net, ICMP_MIB_INERRORS); |
db8dac20 DM |
379 | return; /* No socket for error */ |
380 | } | |
381 | ||
382 | err = 0; | |
383 | harderr = 0; | |
384 | inet = inet_sk(sk); | |
385 | ||
386 | switch (type) { | |
387 | default: | |
388 | case ICMP_TIME_EXCEEDED: | |
389 | err = EHOSTUNREACH; | |
390 | break; | |
391 | case ICMP_SOURCE_QUENCH: | |
392 | goto out; | |
393 | case ICMP_PARAMETERPROB: | |
394 | err = EPROTO; | |
395 | harderr = 1; | |
396 | break; | |
397 | case ICMP_DEST_UNREACH: | |
398 | if (code == ICMP_FRAG_NEEDED) { /* Path MTU discovery */ | |
399 | if (inet->pmtudisc != IP_PMTUDISC_DONT) { | |
400 | err = EMSGSIZE; | |
401 | harderr = 1; | |
402 | break; | |
403 | } | |
404 | goto out; | |
405 | } | |
406 | err = EHOSTUNREACH; | |
407 | if (code <= NR_ICMP_UNREACH) { | |
408 | harderr = icmp_err_convert[code].fatal; | |
409 | err = icmp_err_convert[code].errno; | |
410 | } | |
411 | break; | |
412 | } | |
413 | ||
414 | /* | |
415 | * RFC1122: OK. Passes ICMP errors back to application, as per | |
416 | * 4.1.3.3. | |
417 | */ | |
418 | if (!inet->recverr) { | |
419 | if (!harderr || sk->sk_state != TCP_ESTABLISHED) | |
420 | goto out; | |
421 | } else { | |
422 | ip_icmp_error(sk, skb, err, uh->dest, info, (u8*)(uh+1)); | |
423 | } | |
424 | sk->sk_err = err; | |
425 | sk->sk_error_report(sk); | |
426 | out: | |
427 | sock_put(sk); | |
428 | } | |
429 | ||
430 | void udp_err(struct sk_buff *skb, u32 info) | |
431 | { | |
645ca708 | 432 | __udp4_lib_err(skb, info, &udp_table); |
db8dac20 DM |
433 | } |
434 | ||
435 | /* | |
436 | * Throw away all pending data and cancel the corking. Socket is locked. | |
437 | */ | |
36d926b9 | 438 | void udp_flush_pending_frames(struct sock *sk) |
db8dac20 DM |
439 | { |
440 | struct udp_sock *up = udp_sk(sk); | |
441 | ||
442 | if (up->pending) { | |
443 | up->len = 0; | |
444 | up->pending = 0; | |
445 | ip_flush_pending_frames(sk); | |
446 | } | |
447 | } | |
36d926b9 | 448 | EXPORT_SYMBOL(udp_flush_pending_frames); |
db8dac20 DM |
449 | |
450 | /** | |
451 | * udp4_hwcsum_outgoing - handle outgoing HW checksumming | |
452 | * @sk: socket we are sending on | |
453 | * @skb: sk_buff containing the filled-in UDP header | |
454 | * (checksum field must be zeroed out) | |
455 | */ | |
456 | static void udp4_hwcsum_outgoing(struct sock *sk, struct sk_buff *skb, | |
457 | __be32 src, __be32 dst, int len ) | |
458 | { | |
459 | unsigned int offset; | |
460 | struct udphdr *uh = udp_hdr(skb); | |
461 | __wsum csum = 0; | |
462 | ||
463 | if (skb_queue_len(&sk->sk_write_queue) == 1) { | |
464 | /* | |
465 | * Only one fragment on the socket. | |
466 | */ | |
467 | skb->csum_start = skb_transport_header(skb) - skb->head; | |
468 | skb->csum_offset = offsetof(struct udphdr, check); | |
469 | uh->check = ~csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, 0); | |
470 | } else { | |
471 | /* | |
472 | * HW-checksum won't work as there are two or more | |
473 | * fragments on the socket so that all csums of sk_buffs | |
474 | * should be together | |
475 | */ | |
476 | offset = skb_transport_offset(skb); | |
477 | skb->csum = skb_checksum(skb, offset, skb->len - offset, 0); | |
478 | ||
479 | skb->ip_summed = CHECKSUM_NONE; | |
480 | ||
481 | skb_queue_walk(&sk->sk_write_queue, skb) { | |
482 | csum = csum_add(csum, skb->csum); | |
483 | } | |
484 | ||
485 | uh->check = csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, csum); | |
486 | if (uh->check == 0) | |
487 | uh->check = CSUM_MANGLED_0; | |
488 | } | |
489 | } | |
490 | ||
491 | /* | |
492 | * Push out all pending data as one UDP datagram. Socket is locked. | |
493 | */ | |
494 | static int udp_push_pending_frames(struct sock *sk) | |
495 | { | |
496 | struct udp_sock *up = udp_sk(sk); | |
497 | struct inet_sock *inet = inet_sk(sk); | |
498 | struct flowi *fl = &inet->cork.fl; | |
499 | struct sk_buff *skb; | |
500 | struct udphdr *uh; | |
501 | int err = 0; | |
502 | int is_udplite = IS_UDPLITE(sk); | |
503 | __wsum csum = 0; | |
504 | ||
505 | /* Grab the skbuff where UDP header space exists. */ | |
506 | if ((skb = skb_peek(&sk->sk_write_queue)) == NULL) | |
507 | goto out; | |
508 | ||
509 | /* | |
510 | * Create a UDP header | |
511 | */ | |
512 | uh = udp_hdr(skb); | |
513 | uh->source = fl->fl_ip_sport; | |
514 | uh->dest = fl->fl_ip_dport; | |
515 | uh->len = htons(up->len); | |
516 | uh->check = 0; | |
517 | ||
518 | if (is_udplite) /* UDP-Lite */ | |
519 | csum = udplite_csum_outgoing(sk, skb); | |
520 | ||
521 | else if (sk->sk_no_check == UDP_CSUM_NOXMIT) { /* UDP csum disabled */ | |
522 | ||
523 | skb->ip_summed = CHECKSUM_NONE; | |
524 | goto send; | |
525 | ||
526 | } else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */ | |
527 | ||
528 | udp4_hwcsum_outgoing(sk, skb, fl->fl4_src,fl->fl4_dst, up->len); | |
529 | goto send; | |
530 | ||
531 | } else /* `normal' UDP */ | |
532 | csum = udp_csum_outgoing(sk, skb); | |
533 | ||
534 | /* add protocol-dependent pseudo-header */ | |
535 | uh->check = csum_tcpudp_magic(fl->fl4_src, fl->fl4_dst, up->len, | |
536 | sk->sk_protocol, csum ); | |
537 | if (uh->check == 0) | |
538 | uh->check = CSUM_MANGLED_0; | |
539 | ||
540 | send: | |
541 | err = ip_push_pending_frames(sk); | |
542 | out: | |
543 | up->len = 0; | |
544 | up->pending = 0; | |
545 | if (!err) | |
629ca23c PE |
546 | UDP_INC_STATS_USER(sock_net(sk), |
547 | UDP_MIB_OUTDATAGRAMS, is_udplite); | |
db8dac20 DM |
548 | return err; |
549 | } | |
550 | ||
551 | int udp_sendmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg, | |
552 | size_t len) | |
553 | { | |
554 | struct inet_sock *inet = inet_sk(sk); | |
555 | struct udp_sock *up = udp_sk(sk); | |
556 | int ulen = len; | |
557 | struct ipcm_cookie ipc; | |
558 | struct rtable *rt = NULL; | |
559 | int free = 0; | |
560 | int connected = 0; | |
561 | __be32 daddr, faddr, saddr; | |
562 | __be16 dport; | |
563 | u8 tos; | |
564 | int err, is_udplite = IS_UDPLITE(sk); | |
565 | int corkreq = up->corkflag || msg->msg_flags&MSG_MORE; | |
566 | int (*getfrag)(void *, char *, int, int, int, struct sk_buff *); | |
567 | ||
568 | if (len > 0xFFFF) | |
569 | return -EMSGSIZE; | |
570 | ||
571 | /* | |
572 | * Check the flags. | |
573 | */ | |
574 | ||
575 | if (msg->msg_flags&MSG_OOB) /* Mirror BSD error message compatibility */ | |
576 | return -EOPNOTSUPP; | |
577 | ||
578 | ipc.opt = NULL; | |
579 | ||
580 | if (up->pending) { | |
581 | /* | |
582 | * There are pending frames. | |
583 | * The socket lock must be held while it's corked. | |
584 | */ | |
585 | lock_sock(sk); | |
586 | if (likely(up->pending)) { | |
587 | if (unlikely(up->pending != AF_INET)) { | |
588 | release_sock(sk); | |
589 | return -EINVAL; | |
590 | } | |
591 | goto do_append_data; | |
592 | } | |
593 | release_sock(sk); | |
594 | } | |
595 | ulen += sizeof(struct udphdr); | |
596 | ||
597 | /* | |
598 | * Get and verify the address. | |
599 | */ | |
600 | if (msg->msg_name) { | |
601 | struct sockaddr_in * usin = (struct sockaddr_in*)msg->msg_name; | |
602 | if (msg->msg_namelen < sizeof(*usin)) | |
603 | return -EINVAL; | |
604 | if (usin->sin_family != AF_INET) { | |
605 | if (usin->sin_family != AF_UNSPEC) | |
606 | return -EAFNOSUPPORT; | |
607 | } | |
608 | ||
609 | daddr = usin->sin_addr.s_addr; | |
610 | dport = usin->sin_port; | |
611 | if (dport == 0) | |
612 | return -EINVAL; | |
613 | } else { | |
614 | if (sk->sk_state != TCP_ESTABLISHED) | |
615 | return -EDESTADDRREQ; | |
616 | daddr = inet->daddr; | |
617 | dport = inet->dport; | |
618 | /* Open fast path for connected socket. | |
619 | Route will not be used, if at least one option is set. | |
620 | */ | |
621 | connected = 1; | |
622 | } | |
623 | ipc.addr = inet->saddr; | |
624 | ||
625 | ipc.oif = sk->sk_bound_dev_if; | |
626 | if (msg->msg_controllen) { | |
3b1e0a65 | 627 | err = ip_cmsg_send(sock_net(sk), msg, &ipc); |
db8dac20 DM |
628 | if (err) |
629 | return err; | |
630 | if (ipc.opt) | |
631 | free = 1; | |
632 | connected = 0; | |
633 | } | |
634 | if (!ipc.opt) | |
635 | ipc.opt = inet->opt; | |
636 | ||
637 | saddr = ipc.addr; | |
638 | ipc.addr = faddr = daddr; | |
639 | ||
640 | if (ipc.opt && ipc.opt->srr) { | |
641 | if (!daddr) | |
642 | return -EINVAL; | |
643 | faddr = ipc.opt->faddr; | |
644 | connected = 0; | |
645 | } | |
646 | tos = RT_TOS(inet->tos); | |
647 | if (sock_flag(sk, SOCK_LOCALROUTE) || | |
648 | (msg->msg_flags & MSG_DONTROUTE) || | |
649 | (ipc.opt && ipc.opt->is_strictroute)) { | |
650 | tos |= RTO_ONLINK; | |
651 | connected = 0; | |
652 | } | |
653 | ||
654 | if (ipv4_is_multicast(daddr)) { | |
655 | if (!ipc.oif) | |
656 | ipc.oif = inet->mc_index; | |
657 | if (!saddr) | |
658 | saddr = inet->mc_addr; | |
659 | connected = 0; | |
660 | } | |
661 | ||
662 | if (connected) | |
663 | rt = (struct rtable*)sk_dst_check(sk, 0); | |
664 | ||
665 | if (rt == NULL) { | |
666 | struct flowi fl = { .oif = ipc.oif, | |
667 | .nl_u = { .ip4_u = | |
668 | { .daddr = faddr, | |
669 | .saddr = saddr, | |
670 | .tos = tos } }, | |
671 | .proto = sk->sk_protocol, | |
672 | .uli_u = { .ports = | |
673 | { .sport = inet->sport, | |
674 | .dport = dport } } }; | |
84a3aa00 PE |
675 | struct net *net = sock_net(sk); |
676 | ||
db8dac20 | 677 | security_sk_classify_flow(sk, &fl); |
84a3aa00 | 678 | err = ip_route_output_flow(net, &rt, &fl, sk, 1); |
db8dac20 DM |
679 | if (err) { |
680 | if (err == -ENETUNREACH) | |
7c73a6fa | 681 | IP_INC_STATS_BH(net, IPSTATS_MIB_OUTNOROUTES); |
db8dac20 DM |
682 | goto out; |
683 | } | |
684 | ||
685 | err = -EACCES; | |
686 | if ((rt->rt_flags & RTCF_BROADCAST) && | |
687 | !sock_flag(sk, SOCK_BROADCAST)) | |
688 | goto out; | |
689 | if (connected) | |
690 | sk_dst_set(sk, dst_clone(&rt->u.dst)); | |
691 | } | |
692 | ||
693 | if (msg->msg_flags&MSG_CONFIRM) | |
694 | goto do_confirm; | |
695 | back_from_confirm: | |
696 | ||
697 | saddr = rt->rt_src; | |
698 | if (!ipc.addr) | |
699 | daddr = ipc.addr = rt->rt_dst; | |
700 | ||
701 | lock_sock(sk); | |
702 | if (unlikely(up->pending)) { | |
703 | /* The socket is already corked while preparing it. */ | |
704 | /* ... which is an evident application bug. --ANK */ | |
705 | release_sock(sk); | |
706 | ||
707 | LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 2\n"); | |
708 | err = -EINVAL; | |
709 | goto out; | |
710 | } | |
711 | /* | |
712 | * Now cork the socket to pend data. | |
713 | */ | |
714 | inet->cork.fl.fl4_dst = daddr; | |
715 | inet->cork.fl.fl_ip_dport = dport; | |
716 | inet->cork.fl.fl4_src = saddr; | |
717 | inet->cork.fl.fl_ip_sport = inet->sport; | |
718 | up->pending = AF_INET; | |
719 | ||
720 | do_append_data: | |
721 | up->len += ulen; | |
722 | getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag; | |
723 | err = ip_append_data(sk, getfrag, msg->msg_iov, ulen, | |
724 | sizeof(struct udphdr), &ipc, rt, | |
725 | corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags); | |
726 | if (err) | |
727 | udp_flush_pending_frames(sk); | |
728 | else if (!corkreq) | |
729 | err = udp_push_pending_frames(sk); | |
730 | else if (unlikely(skb_queue_empty(&sk->sk_write_queue))) | |
731 | up->pending = 0; | |
732 | release_sock(sk); | |
733 | ||
734 | out: | |
735 | ip_rt_put(rt); | |
736 | if (free) | |
737 | kfree(ipc.opt); | |
738 | if (!err) | |
739 | return len; | |
740 | /* | |
741 | * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting | |
742 | * ENOBUFS might not be good (it's not tunable per se), but otherwise | |
743 | * we don't have a good statistic (IpOutDiscards but it can be too many | |
744 | * things). We could add another new stat but at least for now that | |
745 | * seems like overkill. | |
746 | */ | |
747 | if (err == -ENOBUFS || test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) { | |
629ca23c PE |
748 | UDP_INC_STATS_USER(sock_net(sk), |
749 | UDP_MIB_SNDBUFERRORS, is_udplite); | |
db8dac20 DM |
750 | } |
751 | return err; | |
752 | ||
753 | do_confirm: | |
754 | dst_confirm(&rt->u.dst); | |
755 | if (!(msg->msg_flags&MSG_PROBE) || len) | |
756 | goto back_from_confirm; | |
757 | err = 0; | |
758 | goto out; | |
759 | } | |
760 | ||
761 | int udp_sendpage(struct sock *sk, struct page *page, int offset, | |
762 | size_t size, int flags) | |
763 | { | |
764 | struct udp_sock *up = udp_sk(sk); | |
765 | int ret; | |
766 | ||
767 | if (!up->pending) { | |
768 | struct msghdr msg = { .msg_flags = flags|MSG_MORE }; | |
769 | ||
770 | /* Call udp_sendmsg to specify destination address which | |
771 | * sendpage interface can't pass. | |
772 | * This will succeed only when the socket is connected. | |
773 | */ | |
774 | ret = udp_sendmsg(NULL, sk, &msg, 0); | |
775 | if (ret < 0) | |
776 | return ret; | |
777 | } | |
778 | ||
779 | lock_sock(sk); | |
780 | ||
781 | if (unlikely(!up->pending)) { | |
782 | release_sock(sk); | |
783 | ||
784 | LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 3\n"); | |
785 | return -EINVAL; | |
786 | } | |
787 | ||
788 | ret = ip_append_page(sk, page, offset, size, flags); | |
789 | if (ret == -EOPNOTSUPP) { | |
790 | release_sock(sk); | |
791 | return sock_no_sendpage(sk->sk_socket, page, offset, | |
792 | size, flags); | |
793 | } | |
794 | if (ret < 0) { | |
795 | udp_flush_pending_frames(sk); | |
796 | goto out; | |
797 | } | |
798 | ||
799 | up->len += size; | |
800 | if (!(up->corkflag || (flags&MSG_MORE))) | |
801 | ret = udp_push_pending_frames(sk); | |
802 | if (!ret) | |
803 | ret = size; | |
804 | out: | |
805 | release_sock(sk); | |
806 | return ret; | |
807 | } | |
808 | ||
1da177e4 LT |
809 | /* |
810 | * IOCTL requests applicable to the UDP protocol | |
811 | */ | |
e905a9ed | 812 | |
1da177e4 LT |
813 | int udp_ioctl(struct sock *sk, int cmd, unsigned long arg) |
814 | { | |
6516c655 SH |
815 | switch (cmd) { |
816 | case SIOCOUTQ: | |
1da177e4 | 817 | { |
6516c655 SH |
818 | int amount = atomic_read(&sk->sk_wmem_alloc); |
819 | return put_user(amount, (int __user *)arg); | |
820 | } | |
1da177e4 | 821 | |
6516c655 SH |
822 | case SIOCINQ: |
823 | { | |
824 | struct sk_buff *skb; | |
825 | unsigned long amount; | |
826 | ||
827 | amount = 0; | |
828 | spin_lock_bh(&sk->sk_receive_queue.lock); | |
829 | skb = skb_peek(&sk->sk_receive_queue); | |
830 | if (skb != NULL) { | |
831 | /* | |
832 | * We will only return the amount | |
833 | * of this packet since that is all | |
834 | * that will be read. | |
835 | */ | |
836 | amount = skb->len - sizeof(struct udphdr); | |
1da177e4 | 837 | } |
6516c655 SH |
838 | spin_unlock_bh(&sk->sk_receive_queue.lock); |
839 | return put_user(amount, (int __user *)arg); | |
840 | } | |
1da177e4 | 841 | |
6516c655 SH |
842 | default: |
843 | return -ENOIOCTLCMD; | |
1da177e4 | 844 | } |
6516c655 SH |
845 | |
846 | return 0; | |
1da177e4 LT |
847 | } |
848 | ||
db8dac20 DM |
849 | /* |
850 | * This should be easy, if there is something there we | |
851 | * return it, otherwise we block. | |
852 | */ | |
853 | ||
854 | int udp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg, | |
855 | size_t len, int noblock, int flags, int *addr_len) | |
856 | { | |
857 | struct inet_sock *inet = inet_sk(sk); | |
858 | struct sockaddr_in *sin = (struct sockaddr_in *)msg->msg_name; | |
859 | struct sk_buff *skb; | |
860 | unsigned int ulen, copied; | |
861 | int peeked; | |
862 | int err; | |
863 | int is_udplite = IS_UDPLITE(sk); | |
864 | ||
865 | /* | |
866 | * Check any passed addresses | |
867 | */ | |
868 | if (addr_len) | |
869 | *addr_len=sizeof(*sin); | |
870 | ||
871 | if (flags & MSG_ERRQUEUE) | |
872 | return ip_recv_error(sk, msg, len); | |
873 | ||
874 | try_again: | |
875 | skb = __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0), | |
876 | &peeked, &err); | |
877 | if (!skb) | |
878 | goto out; | |
879 | ||
880 | ulen = skb->len - sizeof(struct udphdr); | |
881 | copied = len; | |
882 | if (copied > ulen) | |
883 | copied = ulen; | |
884 | else if (copied < ulen) | |
885 | msg->msg_flags |= MSG_TRUNC; | |
886 | ||
887 | /* | |
888 | * If checksum is needed at all, try to do it while copying the | |
889 | * data. If the data is truncated, or if we only want a partial | |
890 | * coverage checksum (UDP-Lite), do it before the copy. | |
891 | */ | |
892 | ||
893 | if (copied < ulen || UDP_SKB_CB(skb)->partial_cov) { | |
894 | if (udp_lib_checksum_complete(skb)) | |
895 | goto csum_copy_err; | |
896 | } | |
897 | ||
898 | if (skb_csum_unnecessary(skb)) | |
899 | err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr), | |
900 | msg->msg_iov, copied ); | |
901 | else { | |
902 | err = skb_copy_and_csum_datagram_iovec(skb, sizeof(struct udphdr), msg->msg_iov); | |
903 | ||
904 | if (err == -EINVAL) | |
905 | goto csum_copy_err; | |
906 | } | |
907 | ||
908 | if (err) | |
909 | goto out_free; | |
910 | ||
911 | if (!peeked) | |
629ca23c PE |
912 | UDP_INC_STATS_USER(sock_net(sk), |
913 | UDP_MIB_INDATAGRAMS, is_udplite); | |
db8dac20 DM |
914 | |
915 | sock_recv_timestamp(msg, sk, skb); | |
916 | ||
917 | /* Copy the address. */ | |
918 | if (sin) | |
919 | { | |
920 | sin->sin_family = AF_INET; | |
921 | sin->sin_port = udp_hdr(skb)->source; | |
922 | sin->sin_addr.s_addr = ip_hdr(skb)->saddr; | |
923 | memset(sin->sin_zero, 0, sizeof(sin->sin_zero)); | |
924 | } | |
925 | if (inet->cmsg_flags) | |
926 | ip_cmsg_recv(msg, skb); | |
927 | ||
928 | err = copied; | |
929 | if (flags & MSG_TRUNC) | |
930 | err = ulen; | |
931 | ||
932 | out_free: | |
933 | lock_sock(sk); | |
934 | skb_free_datagram(sk, skb); | |
935 | release_sock(sk); | |
936 | out: | |
937 | return err; | |
938 | ||
939 | csum_copy_err: | |
940 | lock_sock(sk); | |
941 | if (!skb_kill_datagram(sk, skb, flags)) | |
629ca23c | 942 | UDP_INC_STATS_USER(sock_net(sk), UDP_MIB_INERRORS, is_udplite); |
db8dac20 DM |
943 | release_sock(sk); |
944 | ||
945 | if (noblock) | |
946 | return -EAGAIN; | |
947 | goto try_again; | |
948 | } | |
949 | ||
950 | ||
1da177e4 LT |
951 | int udp_disconnect(struct sock *sk, int flags) |
952 | { | |
953 | struct inet_sock *inet = inet_sk(sk); | |
954 | /* | |
955 | * 1003.1g - break association. | |
956 | */ | |
e905a9ed | 957 | |
1da177e4 LT |
958 | sk->sk_state = TCP_CLOSE; |
959 | inet->daddr = 0; | |
960 | inet->dport = 0; | |
961 | sk->sk_bound_dev_if = 0; | |
962 | if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK)) | |
963 | inet_reset_saddr(sk); | |
964 | ||
965 | if (!(sk->sk_userlocks & SOCK_BINDPORT_LOCK)) { | |
966 | sk->sk_prot->unhash(sk); | |
967 | inet->sport = 0; | |
968 | } | |
969 | sk_dst_reset(sk); | |
970 | return 0; | |
971 | } | |
972 | ||
645ca708 ED |
973 | void udp_lib_unhash(struct sock *sk) |
974 | { | |
975 | struct udp_table *udptable = sk->sk_prot->h.udp_table; | |
976 | unsigned int hash = udp_hashfn(sock_net(sk), sk->sk_hash); | |
977 | struct udp_hslot *hslot = &udptable->hash[hash]; | |
978 | ||
c8db3fec | 979 | spin_lock_bh(&hslot->lock); |
271b72c7 | 980 | if (sk_del_node_init_rcu(sk)) { |
645ca708 ED |
981 | inet_sk(sk)->num = 0; |
982 | sock_prot_inuse_add(sock_net(sk), sk->sk_prot, -1); | |
983 | } | |
c8db3fec | 984 | spin_unlock_bh(&hslot->lock); |
645ca708 ED |
985 | } |
986 | EXPORT_SYMBOL(udp_lib_unhash); | |
987 | ||
93821778 HX |
988 | static int __udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb) |
989 | { | |
990 | int is_udplite = IS_UDPLITE(sk); | |
991 | int rc; | |
992 | ||
993 | if ((rc = sock_queue_rcv_skb(sk, skb)) < 0) { | |
994 | /* Note that an ENOMEM error is charged twice */ | |
995 | if (rc == -ENOMEM) | |
996 | UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS, | |
997 | is_udplite); | |
998 | goto drop; | |
999 | } | |
1000 | ||
1001 | return 0; | |
1002 | ||
1003 | drop: | |
1004 | UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite); | |
1005 | kfree_skb(skb); | |
1006 | return -1; | |
1007 | } | |
1008 | ||
db8dac20 DM |
1009 | /* returns: |
1010 | * -1: error | |
1011 | * 0: success | |
1012 | * >0: "udp encap" protocol resubmission | |
1013 | * | |
1014 | * Note that in the success and error cases, the skb is assumed to | |
1015 | * have either been requeued or freed. | |
1016 | */ | |
1017 | int udp_queue_rcv_skb(struct sock * sk, struct sk_buff *skb) | |
1018 | { | |
1019 | struct udp_sock *up = udp_sk(sk); | |
1020 | int rc; | |
1021 | int is_udplite = IS_UDPLITE(sk); | |
1022 | ||
1023 | /* | |
1024 | * Charge it to the socket, dropping if the queue is full. | |
1025 | */ | |
1026 | if (!xfrm4_policy_check(sk, XFRM_POLICY_IN, skb)) | |
1027 | goto drop; | |
1028 | nf_reset(skb); | |
1029 | ||
1030 | if (up->encap_type) { | |
1031 | /* | |
1032 | * This is an encapsulation socket so pass the skb to | |
1033 | * the socket's udp_encap_rcv() hook. Otherwise, just | |
1034 | * fall through and pass this up the UDP socket. | |
1035 | * up->encap_rcv() returns the following value: | |
1036 | * =0 if skb was successfully passed to the encap | |
1037 | * handler or was discarded by it. | |
1038 | * >0 if skb should be passed on to UDP. | |
1039 | * <0 if skb should be resubmitted as proto -N | |
1040 | */ | |
1041 | ||
1042 | /* if we're overly short, let UDP handle it */ | |
1043 | if (skb->len > sizeof(struct udphdr) && | |
1044 | up->encap_rcv != NULL) { | |
1045 | int ret; | |
1046 | ||
1047 | ret = (*up->encap_rcv)(sk, skb); | |
1048 | if (ret <= 0) { | |
0283328e PE |
1049 | UDP_INC_STATS_BH(sock_net(sk), |
1050 | UDP_MIB_INDATAGRAMS, | |
db8dac20 DM |
1051 | is_udplite); |
1052 | return -ret; | |
1053 | } | |
1054 | } | |
1055 | ||
1056 | /* FALLTHROUGH -- it's a UDP Packet */ | |
1057 | } | |
1058 | ||
1059 | /* | |
1060 | * UDP-Lite specific tests, ignored on UDP sockets | |
1061 | */ | |
1062 | if ((is_udplite & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) { | |
1063 | ||
1064 | /* | |
1065 | * MIB statistics other than incrementing the error count are | |
1066 | * disabled for the following two types of errors: these depend | |
1067 | * on the application settings, not on the functioning of the | |
1068 | * protocol stack as such. | |
1069 | * | |
1070 | * RFC 3828 here recommends (sec 3.3): "There should also be a | |
1071 | * way ... to ... at least let the receiving application block | |
1072 | * delivery of packets with coverage values less than a value | |
1073 | * provided by the application." | |
1074 | */ | |
1075 | if (up->pcrlen == 0) { /* full coverage was set */ | |
1076 | LIMIT_NETDEBUG(KERN_WARNING "UDPLITE: partial coverage " | |
1077 | "%d while full coverage %d requested\n", | |
1078 | UDP_SKB_CB(skb)->cscov, skb->len); | |
1079 | goto drop; | |
1080 | } | |
1081 | /* The next case involves violating the min. coverage requested | |
1082 | * by the receiver. This is subtle: if receiver wants x and x is | |
1083 | * greater than the buffersize/MTU then receiver will complain | |
1084 | * that it wants x while sender emits packets of smaller size y. | |
1085 | * Therefore the above ...()->partial_cov statement is essential. | |
1086 | */ | |
1087 | if (UDP_SKB_CB(skb)->cscov < up->pcrlen) { | |
1088 | LIMIT_NETDEBUG(KERN_WARNING | |
1089 | "UDPLITE: coverage %d too small, need min %d\n", | |
1090 | UDP_SKB_CB(skb)->cscov, up->pcrlen); | |
1091 | goto drop; | |
1092 | } | |
1093 | } | |
1094 | ||
1095 | if (sk->sk_filter) { | |
1096 | if (udp_lib_checksum_complete(skb)) | |
1097 | goto drop; | |
1098 | } | |
1099 | ||
93821778 | 1100 | rc = 0; |
db8dac20 | 1101 | |
93821778 HX |
1102 | bh_lock_sock(sk); |
1103 | if (!sock_owned_by_user(sk)) | |
1104 | rc = __udp_queue_rcv_skb(sk, skb); | |
1105 | else | |
1106 | sk_add_backlog(sk, skb); | |
1107 | bh_unlock_sock(sk); | |
1108 | ||
1109 | return rc; | |
db8dac20 DM |
1110 | |
1111 | drop: | |
0283328e | 1112 | UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite); |
db8dac20 DM |
1113 | kfree_skb(skb); |
1114 | return -1; | |
1115 | } | |
1116 | ||
1117 | /* | |
1118 | * Multicasts and broadcasts go to each listener. | |
1119 | * | |
1120 | * Note: called only from the BH handler context, | |
1121 | * so we don't need to lock the hashes. | |
1122 | */ | |
e3163493 | 1123 | static int __udp4_lib_mcast_deliver(struct net *net, struct sk_buff *skb, |
db8dac20 DM |
1124 | struct udphdr *uh, |
1125 | __be32 saddr, __be32 daddr, | |
645ca708 | 1126 | struct udp_table *udptable) |
db8dac20 DM |
1127 | { |
1128 | struct sock *sk; | |
645ca708 | 1129 | struct udp_hslot *hslot = &udptable->hash[udp_hashfn(net, ntohs(uh->dest))]; |
db8dac20 DM |
1130 | int dif; |
1131 | ||
645ca708 ED |
1132 | spin_lock(&hslot->lock); |
1133 | sk = sk_head(&hslot->head); | |
db8dac20 | 1134 | dif = skb->dev->ifindex; |
920a4611 | 1135 | sk = udp_v4_mcast_next(net, sk, uh->dest, daddr, uh->source, saddr, dif); |
db8dac20 DM |
1136 | if (sk) { |
1137 | struct sock *sknext = NULL; | |
1138 | ||
1139 | do { | |
1140 | struct sk_buff *skb1 = skb; | |
1141 | ||
920a4611 ED |
1142 | sknext = udp_v4_mcast_next(net, sk_next(sk), uh->dest, |
1143 | daddr, uh->source, saddr, | |
1144 | dif); | |
db8dac20 DM |
1145 | if (sknext) |
1146 | skb1 = skb_clone(skb, GFP_ATOMIC); | |
1147 | ||
1148 | if (skb1) { | |
93821778 | 1149 | int ret = udp_queue_rcv_skb(sk, skb1); |
db8dac20 DM |
1150 | if (ret > 0) |
1151 | /* we should probably re-process instead | |
1152 | * of dropping packets here. */ | |
1153 | kfree_skb(skb1); | |
1154 | } | |
1155 | sk = sknext; | |
1156 | } while (sknext); | |
1157 | } else | |
1158 | kfree_skb(skb); | |
645ca708 | 1159 | spin_unlock(&hslot->lock); |
db8dac20 DM |
1160 | return 0; |
1161 | } | |
1162 | ||
1163 | /* Initialize UDP checksum. If exited with zero value (success), | |
1164 | * CHECKSUM_UNNECESSARY means, that no more checks are required. | |
1165 | * Otherwise, csum completion requires chacksumming packet body, | |
1166 | * including udp header and folding it to skb->csum. | |
1167 | */ | |
1168 | static inline int udp4_csum_init(struct sk_buff *skb, struct udphdr *uh, | |
1169 | int proto) | |
1170 | { | |
1171 | const struct iphdr *iph; | |
1172 | int err; | |
1173 | ||
1174 | UDP_SKB_CB(skb)->partial_cov = 0; | |
1175 | UDP_SKB_CB(skb)->cscov = skb->len; | |
1176 | ||
1177 | if (proto == IPPROTO_UDPLITE) { | |
1178 | err = udplite_checksum_init(skb, uh); | |
1179 | if (err) | |
1180 | return err; | |
1181 | } | |
1182 | ||
1183 | iph = ip_hdr(skb); | |
1184 | if (uh->check == 0) { | |
1185 | skb->ip_summed = CHECKSUM_UNNECESSARY; | |
1186 | } else if (skb->ip_summed == CHECKSUM_COMPLETE) { | |
1187 | if (!csum_tcpudp_magic(iph->saddr, iph->daddr, skb->len, | |
1188 | proto, skb->csum)) | |
1189 | skb->ip_summed = CHECKSUM_UNNECESSARY; | |
1190 | } | |
1191 | if (!skb_csum_unnecessary(skb)) | |
1192 | skb->csum = csum_tcpudp_nofold(iph->saddr, iph->daddr, | |
1193 | skb->len, proto, 0); | |
1194 | /* Probably, we should checksum udp header (it should be in cache | |
1195 | * in any case) and data in tiny packets (< rx copybreak). | |
1196 | */ | |
1197 | ||
1198 | return 0; | |
1199 | } | |
1200 | ||
1201 | /* | |
1202 | * All we need to do is get the socket, and then do a checksum. | |
1203 | */ | |
1204 | ||
645ca708 | 1205 | int __udp4_lib_rcv(struct sk_buff *skb, struct udp_table *udptable, |
db8dac20 DM |
1206 | int proto) |
1207 | { | |
1208 | struct sock *sk; | |
1209 | struct udphdr *uh = udp_hdr(skb); | |
1210 | unsigned short ulen; | |
1211 | struct rtable *rt = (struct rtable*)skb->dst; | |
1212 | __be32 saddr = ip_hdr(skb)->saddr; | |
1213 | __be32 daddr = ip_hdr(skb)->daddr; | |
0283328e | 1214 | struct net *net = dev_net(skb->dev); |
db8dac20 DM |
1215 | |
1216 | /* | |
1217 | * Validate the packet. | |
1218 | */ | |
1219 | if (!pskb_may_pull(skb, sizeof(struct udphdr))) | |
1220 | goto drop; /* No space for header. */ | |
1221 | ||
1222 | ulen = ntohs(uh->len); | |
1223 | if (ulen > skb->len) | |
1224 | goto short_packet; | |
1225 | ||
1226 | if (proto == IPPROTO_UDP) { | |
1227 | /* UDP validates ulen. */ | |
1228 | if (ulen < sizeof(*uh) || pskb_trim_rcsum(skb, ulen)) | |
1229 | goto short_packet; | |
1230 | uh = udp_hdr(skb); | |
1231 | } | |
1232 | ||
1233 | if (udp4_csum_init(skb, uh, proto)) | |
1234 | goto csum_error; | |
1235 | ||
1236 | if (rt->rt_flags & (RTCF_BROADCAST|RTCF_MULTICAST)) | |
e3163493 PE |
1237 | return __udp4_lib_mcast_deliver(net, skb, uh, |
1238 | saddr, daddr, udptable); | |
db8dac20 | 1239 | |
607c4aaf | 1240 | sk = __udp4_lib_lookup_skb(skb, uh->source, uh->dest, udptable); |
db8dac20 DM |
1241 | |
1242 | if (sk != NULL) { | |
93821778 | 1243 | int ret = udp_queue_rcv_skb(sk, skb); |
db8dac20 DM |
1244 | sock_put(sk); |
1245 | ||
1246 | /* a return value > 0 means to resubmit the input, but | |
1247 | * it wants the return to be -protocol, or 0 | |
1248 | */ | |
1249 | if (ret > 0) | |
1250 | return -ret; | |
1251 | return 0; | |
1252 | } | |
1253 | ||
1254 | if (!xfrm4_policy_check(NULL, XFRM_POLICY_IN, skb)) | |
1255 | goto drop; | |
1256 | nf_reset(skb); | |
1257 | ||
1258 | /* No socket. Drop packet silently, if checksum is wrong */ | |
1259 | if (udp_lib_checksum_complete(skb)) | |
1260 | goto csum_error; | |
1261 | ||
0283328e | 1262 | UDP_INC_STATS_BH(net, UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE); |
db8dac20 DM |
1263 | icmp_send(skb, ICMP_DEST_UNREACH, ICMP_PORT_UNREACH, 0); |
1264 | ||
1265 | /* | |
1266 | * Hmm. We got an UDP packet to a port to which we | |
1267 | * don't wanna listen. Ignore it. | |
1268 | */ | |
1269 | kfree_skb(skb); | |
1270 | return 0; | |
1271 | ||
1272 | short_packet: | |
673d57e7 | 1273 | LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: short packet: From %pI4:%u %d/%d to %pI4:%u\n", |
db8dac20 | 1274 | proto == IPPROTO_UDPLITE ? "-Lite" : "", |
673d57e7 | 1275 | &saddr, |
db8dac20 DM |
1276 | ntohs(uh->source), |
1277 | ulen, | |
1278 | skb->len, | |
673d57e7 | 1279 | &daddr, |
db8dac20 DM |
1280 | ntohs(uh->dest)); |
1281 | goto drop; | |
1282 | ||
1283 | csum_error: | |
1284 | /* | |
1285 | * RFC1122: OK. Discards the bad packet silently (as far as | |
1286 | * the network is concerned, anyway) as per 4.1.3.4 (MUST). | |
1287 | */ | |
673d57e7 | 1288 | LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: bad checksum. From %pI4:%u to %pI4:%u ulen %d\n", |
db8dac20 | 1289 | proto == IPPROTO_UDPLITE ? "-Lite" : "", |
673d57e7 | 1290 | &saddr, |
db8dac20 | 1291 | ntohs(uh->source), |
673d57e7 | 1292 | &daddr, |
db8dac20 DM |
1293 | ntohs(uh->dest), |
1294 | ulen); | |
1295 | drop: | |
0283328e | 1296 | UDP_INC_STATS_BH(net, UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE); |
db8dac20 DM |
1297 | kfree_skb(skb); |
1298 | return 0; | |
1299 | } | |
1300 | ||
1301 | int udp_rcv(struct sk_buff *skb) | |
1302 | { | |
645ca708 | 1303 | return __udp4_lib_rcv(skb, &udp_table, IPPROTO_UDP); |
db8dac20 DM |
1304 | } |
1305 | ||
7d06b2e0 | 1306 | void udp_destroy_sock(struct sock *sk) |
db8dac20 DM |
1307 | { |
1308 | lock_sock(sk); | |
1309 | udp_flush_pending_frames(sk); | |
1310 | release_sock(sk); | |
db8dac20 DM |
1311 | } |
1312 | ||
1da177e4 LT |
1313 | /* |
1314 | * Socket option code for UDP | |
1315 | */ | |
4c0a6cb0 GR |
1316 | int udp_lib_setsockopt(struct sock *sk, int level, int optname, |
1317 | char __user *optval, int optlen, | |
1318 | int (*push_pending_frames)(struct sock *)) | |
1da177e4 LT |
1319 | { |
1320 | struct udp_sock *up = udp_sk(sk); | |
1321 | int val; | |
1322 | int err = 0; | |
b2bf1e26 | 1323 | int is_udplite = IS_UDPLITE(sk); |
1da177e4 | 1324 | |
6516c655 | 1325 | if (optlen<sizeof(int)) |
1da177e4 LT |
1326 | return -EINVAL; |
1327 | ||
1328 | if (get_user(val, (int __user *)optval)) | |
1329 | return -EFAULT; | |
1330 | ||
6516c655 | 1331 | switch (optname) { |
1da177e4 LT |
1332 | case UDP_CORK: |
1333 | if (val != 0) { | |
1334 | up->corkflag = 1; | |
1335 | } else { | |
1336 | up->corkflag = 0; | |
1337 | lock_sock(sk); | |
4c0a6cb0 | 1338 | (*push_pending_frames)(sk); |
1da177e4 LT |
1339 | release_sock(sk); |
1340 | } | |
1341 | break; | |
e905a9ed | 1342 | |
1da177e4 LT |
1343 | case UDP_ENCAP: |
1344 | switch (val) { | |
1345 | case 0: | |
1346 | case UDP_ENCAP_ESPINUDP: | |
1347 | case UDP_ENCAP_ESPINUDP_NON_IKE: | |
067b207b JC |
1348 | up->encap_rcv = xfrm4_udp_encap_rcv; |
1349 | /* FALLTHROUGH */ | |
342f0234 | 1350 | case UDP_ENCAP_L2TPINUDP: |
1da177e4 LT |
1351 | up->encap_type = val; |
1352 | break; | |
1353 | default: | |
1354 | err = -ENOPROTOOPT; | |
1355 | break; | |
1356 | } | |
1357 | break; | |
1358 | ||
ba4e58ec GR |
1359 | /* |
1360 | * UDP-Lite's partial checksum coverage (RFC 3828). | |
1361 | */ | |
1362 | /* The sender sets actual checksum coverage length via this option. | |
1363 | * The case coverage > packet length is handled by send module. */ | |
1364 | case UDPLITE_SEND_CSCOV: | |
b2bf1e26 | 1365 | if (!is_udplite) /* Disable the option on UDP sockets */ |
ba4e58ec GR |
1366 | return -ENOPROTOOPT; |
1367 | if (val != 0 && val < 8) /* Illegal coverage: use default (8) */ | |
1368 | val = 8; | |
47112e25 GR |
1369 | else if (val > USHORT_MAX) |
1370 | val = USHORT_MAX; | |
ba4e58ec GR |
1371 | up->pcslen = val; |
1372 | up->pcflag |= UDPLITE_SEND_CC; | |
1373 | break; | |
1374 | ||
e905a9ed YH |
1375 | /* The receiver specifies a minimum checksum coverage value. To make |
1376 | * sense, this should be set to at least 8 (as done below). If zero is | |
ba4e58ec GR |
1377 | * used, this again means full checksum coverage. */ |
1378 | case UDPLITE_RECV_CSCOV: | |
b2bf1e26 | 1379 | if (!is_udplite) /* Disable the option on UDP sockets */ |
ba4e58ec GR |
1380 | return -ENOPROTOOPT; |
1381 | if (val != 0 && val < 8) /* Avoid silly minimal values. */ | |
1382 | val = 8; | |
47112e25 GR |
1383 | else if (val > USHORT_MAX) |
1384 | val = USHORT_MAX; | |
ba4e58ec GR |
1385 | up->pcrlen = val; |
1386 | up->pcflag |= UDPLITE_RECV_CC; | |
1387 | break; | |
1388 | ||
1da177e4 LT |
1389 | default: |
1390 | err = -ENOPROTOOPT; | |
1391 | break; | |
6516c655 | 1392 | } |
1da177e4 LT |
1393 | |
1394 | return err; | |
1395 | } | |
1396 | ||
db8dac20 DM |
1397 | int udp_setsockopt(struct sock *sk, int level, int optname, |
1398 | char __user *optval, int optlen) | |
1399 | { | |
1400 | if (level == SOL_UDP || level == SOL_UDPLITE) | |
1401 | return udp_lib_setsockopt(sk, level, optname, optval, optlen, | |
1402 | udp_push_pending_frames); | |
1403 | return ip_setsockopt(sk, level, optname, optval, optlen); | |
1404 | } | |
1405 | ||
1406 | #ifdef CONFIG_COMPAT | |
1407 | int compat_udp_setsockopt(struct sock *sk, int level, int optname, | |
1408 | char __user *optval, int optlen) | |
1409 | { | |
1410 | if (level == SOL_UDP || level == SOL_UDPLITE) | |
1411 | return udp_lib_setsockopt(sk, level, optname, optval, optlen, | |
1412 | udp_push_pending_frames); | |
1413 | return compat_ip_setsockopt(sk, level, optname, optval, optlen); | |
1414 | } | |
1415 | #endif | |
1416 | ||
4c0a6cb0 GR |
1417 | int udp_lib_getsockopt(struct sock *sk, int level, int optname, |
1418 | char __user *optval, int __user *optlen) | |
1da177e4 LT |
1419 | { |
1420 | struct udp_sock *up = udp_sk(sk); | |
1421 | int val, len; | |
1422 | ||
6516c655 | 1423 | if (get_user(len,optlen)) |
1da177e4 LT |
1424 | return -EFAULT; |
1425 | ||
1426 | len = min_t(unsigned int, len, sizeof(int)); | |
e905a9ed | 1427 | |
6516c655 | 1428 | if (len < 0) |
1da177e4 LT |
1429 | return -EINVAL; |
1430 | ||
6516c655 | 1431 | switch (optname) { |
1da177e4 LT |
1432 | case UDP_CORK: |
1433 | val = up->corkflag; | |
1434 | break; | |
1435 | ||
1436 | case UDP_ENCAP: | |
1437 | val = up->encap_type; | |
1438 | break; | |
1439 | ||
ba4e58ec GR |
1440 | /* The following two cannot be changed on UDP sockets, the return is |
1441 | * always 0 (which corresponds to the full checksum coverage of UDP). */ | |
1442 | case UDPLITE_SEND_CSCOV: | |
1443 | val = up->pcslen; | |
1444 | break; | |
1445 | ||
1446 | case UDPLITE_RECV_CSCOV: | |
1447 | val = up->pcrlen; | |
1448 | break; | |
1449 | ||
1da177e4 LT |
1450 | default: |
1451 | return -ENOPROTOOPT; | |
6516c655 | 1452 | } |
1da177e4 | 1453 | |
6516c655 | 1454 | if (put_user(len, optlen)) |
e905a9ed | 1455 | return -EFAULT; |
6516c655 | 1456 | if (copy_to_user(optval, &val,len)) |
1da177e4 | 1457 | return -EFAULT; |
e905a9ed | 1458 | return 0; |
1da177e4 LT |
1459 | } |
1460 | ||
db8dac20 DM |
1461 | int udp_getsockopt(struct sock *sk, int level, int optname, |
1462 | char __user *optval, int __user *optlen) | |
1463 | { | |
1464 | if (level == SOL_UDP || level == SOL_UDPLITE) | |
1465 | return udp_lib_getsockopt(sk, level, optname, optval, optlen); | |
1466 | return ip_getsockopt(sk, level, optname, optval, optlen); | |
1467 | } | |
1468 | ||
1469 | #ifdef CONFIG_COMPAT | |
1470 | int compat_udp_getsockopt(struct sock *sk, int level, int optname, | |
1471 | char __user *optval, int __user *optlen) | |
1472 | { | |
1473 | if (level == SOL_UDP || level == SOL_UDPLITE) | |
1474 | return udp_lib_getsockopt(sk, level, optname, optval, optlen); | |
1475 | return compat_ip_getsockopt(sk, level, optname, optval, optlen); | |
1476 | } | |
1477 | #endif | |
1da177e4 LT |
1478 | /** |
1479 | * udp_poll - wait for a UDP event. | |
1480 | * @file - file struct | |
1481 | * @sock - socket | |
1482 | * @wait - poll table | |
1483 | * | |
e905a9ed | 1484 | * This is same as datagram poll, except for the special case of |
1da177e4 LT |
1485 | * blocking sockets. If application is using a blocking fd |
1486 | * and a packet with checksum error is in the queue; | |
1487 | * then it could get return from select indicating data available | |
1488 | * but then block when reading it. Add special case code | |
1489 | * to work around these arguably broken applications. | |
1490 | */ | |
1491 | unsigned int udp_poll(struct file *file, struct socket *sock, poll_table *wait) | |
1492 | { | |
1493 | unsigned int mask = datagram_poll(file, sock, wait); | |
1494 | struct sock *sk = sock->sk; | |
ba4e58ec GR |
1495 | int is_lite = IS_UDPLITE(sk); |
1496 | ||
1da177e4 LT |
1497 | /* Check for false positives due to checksum errors */ |
1498 | if ( (mask & POLLRDNORM) && | |
1499 | !(file->f_flags & O_NONBLOCK) && | |
1500 | !(sk->sk_shutdown & RCV_SHUTDOWN)){ | |
1501 | struct sk_buff_head *rcvq = &sk->sk_receive_queue; | |
1502 | struct sk_buff *skb; | |
1503 | ||
208d8984 | 1504 | spin_lock_bh(&rcvq->lock); |
759e5d00 HX |
1505 | while ((skb = skb_peek(rcvq)) != NULL && |
1506 | udp_lib_checksum_complete(skb)) { | |
0283328e PE |
1507 | UDP_INC_STATS_BH(sock_net(sk), |
1508 | UDP_MIB_INERRORS, is_lite); | |
759e5d00 HX |
1509 | __skb_unlink(skb, rcvq); |
1510 | kfree_skb(skb); | |
1da177e4 | 1511 | } |
208d8984 | 1512 | spin_unlock_bh(&rcvq->lock); |
1da177e4 LT |
1513 | |
1514 | /* nothing to see, move along */ | |
1515 | if (skb == NULL) | |
1516 | mask &= ~(POLLIN | POLLRDNORM); | |
1517 | } | |
1518 | ||
1519 | return mask; | |
e905a9ed | 1520 | |
1da177e4 LT |
1521 | } |
1522 | ||
db8dac20 DM |
1523 | struct proto udp_prot = { |
1524 | .name = "UDP", | |
1525 | .owner = THIS_MODULE, | |
1526 | .close = udp_lib_close, | |
1527 | .connect = ip4_datagram_connect, | |
1528 | .disconnect = udp_disconnect, | |
1529 | .ioctl = udp_ioctl, | |
1530 | .destroy = udp_destroy_sock, | |
1531 | .setsockopt = udp_setsockopt, | |
1532 | .getsockopt = udp_getsockopt, | |
1533 | .sendmsg = udp_sendmsg, | |
1534 | .recvmsg = udp_recvmsg, | |
1535 | .sendpage = udp_sendpage, | |
93821778 | 1536 | .backlog_rcv = __udp_queue_rcv_skb, |
db8dac20 DM |
1537 | .hash = udp_lib_hash, |
1538 | .unhash = udp_lib_unhash, | |
1539 | .get_port = udp_v4_get_port, | |
1540 | .memory_allocated = &udp_memory_allocated, | |
1541 | .sysctl_mem = sysctl_udp_mem, | |
1542 | .sysctl_wmem = &sysctl_udp_wmem_min, | |
1543 | .sysctl_rmem = &sysctl_udp_rmem_min, | |
1544 | .obj_size = sizeof(struct udp_sock), | |
271b72c7 | 1545 | .slab_flags = SLAB_DESTROY_BY_RCU, |
645ca708 | 1546 | .h.udp_table = &udp_table, |
db8dac20 DM |
1547 | #ifdef CONFIG_COMPAT |
1548 | .compat_setsockopt = compat_udp_setsockopt, | |
1549 | .compat_getsockopt = compat_udp_getsockopt, | |
1550 | #endif | |
db8dac20 | 1551 | }; |
1da177e4 LT |
1552 | |
1553 | /* ------------------------------------------------------------------------ */ | |
1554 | #ifdef CONFIG_PROC_FS | |
1555 | ||
645ca708 | 1556 | static struct sock *udp_get_first(struct seq_file *seq, int start) |
1da177e4 LT |
1557 | { |
1558 | struct sock *sk; | |
1559 | struct udp_iter_state *state = seq->private; | |
6f191efe | 1560 | struct net *net = seq_file_net(seq); |
1da177e4 | 1561 | |
645ca708 | 1562 | for (state->bucket = start; state->bucket < UDP_HTABLE_SIZE; ++state->bucket) { |
1da177e4 | 1563 | struct hlist_node *node; |
645ca708 ED |
1564 | struct udp_hslot *hslot = &state->udp_table->hash[state->bucket]; |
1565 | spin_lock_bh(&hslot->lock); | |
1566 | sk_for_each(sk, node, &hslot->head) { | |
878628fb | 1567 | if (!net_eq(sock_net(sk), net)) |
a91275ef | 1568 | continue; |
1da177e4 LT |
1569 | if (sk->sk_family == state->family) |
1570 | goto found; | |
1571 | } | |
645ca708 | 1572 | spin_unlock_bh(&hslot->lock); |
1da177e4 LT |
1573 | } |
1574 | sk = NULL; | |
1575 | found: | |
1576 | return sk; | |
1577 | } | |
1578 | ||
1579 | static struct sock *udp_get_next(struct seq_file *seq, struct sock *sk) | |
1580 | { | |
1581 | struct udp_iter_state *state = seq->private; | |
6f191efe | 1582 | struct net *net = seq_file_net(seq); |
1da177e4 LT |
1583 | |
1584 | do { | |
1585 | sk = sk_next(sk); | |
878628fb | 1586 | } while (sk && (!net_eq(sock_net(sk), net) || sk->sk_family != state->family)); |
1da177e4 | 1587 | |
645ca708 | 1588 | if (!sk) { |
f52b5054 | 1589 | spin_unlock_bh(&state->udp_table->hash[state->bucket].lock); |
645ca708 | 1590 | return udp_get_first(seq, state->bucket + 1); |
1da177e4 LT |
1591 | } |
1592 | return sk; | |
1593 | } | |
1594 | ||
1595 | static struct sock *udp_get_idx(struct seq_file *seq, loff_t pos) | |
1596 | { | |
645ca708 | 1597 | struct sock *sk = udp_get_first(seq, 0); |
1da177e4 LT |
1598 | |
1599 | if (sk) | |
6516c655 | 1600 | while (pos && (sk = udp_get_next(seq, sk)) != NULL) |
1da177e4 LT |
1601 | --pos; |
1602 | return pos ? NULL : sk; | |
1603 | } | |
1604 | ||
1605 | static void *udp_seq_start(struct seq_file *seq, loff_t *pos) | |
1606 | { | |
b50660f1 | 1607 | return *pos ? udp_get_idx(seq, *pos-1) : SEQ_START_TOKEN; |
1da177e4 LT |
1608 | } |
1609 | ||
1610 | static void *udp_seq_next(struct seq_file *seq, void *v, loff_t *pos) | |
1611 | { | |
1612 | struct sock *sk; | |
1613 | ||
b50660f1 | 1614 | if (v == SEQ_START_TOKEN) |
1da177e4 LT |
1615 | sk = udp_get_idx(seq, 0); |
1616 | else | |
1617 | sk = udp_get_next(seq, v); | |
1618 | ||
1619 | ++*pos; | |
1620 | return sk; | |
1621 | } | |
1622 | ||
1623 | static void udp_seq_stop(struct seq_file *seq, void *v) | |
1624 | { | |
645ca708 ED |
1625 | struct udp_iter_state *state = seq->private; |
1626 | ||
1627 | if (state->bucket < UDP_HTABLE_SIZE) | |
1628 | spin_unlock_bh(&state->udp_table->hash[state->bucket].lock); | |
1da177e4 LT |
1629 | } |
1630 | ||
1631 | static int udp_seq_open(struct inode *inode, struct file *file) | |
1632 | { | |
1633 | struct udp_seq_afinfo *afinfo = PDE(inode)->data; | |
a2be75c1 DL |
1634 | struct udp_iter_state *s; |
1635 | int err; | |
a91275ef | 1636 | |
a2be75c1 DL |
1637 | err = seq_open_net(inode, file, &afinfo->seq_ops, |
1638 | sizeof(struct udp_iter_state)); | |
1639 | if (err < 0) | |
1640 | return err; | |
a91275ef | 1641 | |
a2be75c1 | 1642 | s = ((struct seq_file *)file->private_data)->private; |
1da177e4 | 1643 | s->family = afinfo->family; |
645ca708 | 1644 | s->udp_table = afinfo->udp_table; |
a2be75c1 | 1645 | return err; |
a91275ef DL |
1646 | } |
1647 | ||
1da177e4 | 1648 | /* ------------------------------------------------------------------------ */ |
0c96d8c5 | 1649 | int udp_proc_register(struct net *net, struct udp_seq_afinfo *afinfo) |
1da177e4 LT |
1650 | { |
1651 | struct proc_dir_entry *p; | |
1652 | int rc = 0; | |
1653 | ||
3ba9441b DL |
1654 | afinfo->seq_fops.open = udp_seq_open; |
1655 | afinfo->seq_fops.read = seq_read; | |
1656 | afinfo->seq_fops.llseek = seq_lseek; | |
1657 | afinfo->seq_fops.release = seq_release_net; | |
1da177e4 | 1658 | |
dda61925 DL |
1659 | afinfo->seq_ops.start = udp_seq_start; |
1660 | afinfo->seq_ops.next = udp_seq_next; | |
1661 | afinfo->seq_ops.stop = udp_seq_stop; | |
1662 | ||
84841c3c DL |
1663 | p = proc_create_data(afinfo->name, S_IRUGO, net->proc_net, |
1664 | &afinfo->seq_fops, afinfo); | |
1665 | if (!p) | |
1da177e4 LT |
1666 | rc = -ENOMEM; |
1667 | return rc; | |
1668 | } | |
1669 | ||
0c96d8c5 | 1670 | void udp_proc_unregister(struct net *net, struct udp_seq_afinfo *afinfo) |
1da177e4 | 1671 | { |
0c96d8c5 | 1672 | proc_net_remove(net, afinfo->name); |
1da177e4 | 1673 | } |
db8dac20 DM |
1674 | |
1675 | /* ------------------------------------------------------------------------ */ | |
5e659e4c PE |
1676 | static void udp4_format_sock(struct sock *sp, struct seq_file *f, |
1677 | int bucket, int *len) | |
db8dac20 DM |
1678 | { |
1679 | struct inet_sock *inet = inet_sk(sp); | |
1680 | __be32 dest = inet->daddr; | |
1681 | __be32 src = inet->rcv_saddr; | |
1682 | __u16 destp = ntohs(inet->dport); | |
1683 | __u16 srcp = ntohs(inet->sport); | |
1684 | ||
5e659e4c | 1685 | seq_printf(f, "%4d: %08X:%04X %08X:%04X" |
cb61cb9b | 1686 | " %02X %08X:%08X %02X:%08lX %08X %5d %8d %lu %d %p %d%n", |
db8dac20 DM |
1687 | bucket, src, srcp, dest, destp, sp->sk_state, |
1688 | atomic_read(&sp->sk_wmem_alloc), | |
1689 | atomic_read(&sp->sk_rmem_alloc), | |
1690 | 0, 0L, 0, sock_i_uid(sp), 0, sock_i_ino(sp), | |
cb61cb9b ED |
1691 | atomic_read(&sp->sk_refcnt), sp, |
1692 | atomic_read(&sp->sk_drops), len); | |
db8dac20 DM |
1693 | } |
1694 | ||
1695 | int udp4_seq_show(struct seq_file *seq, void *v) | |
1696 | { | |
1697 | if (v == SEQ_START_TOKEN) | |
1698 | seq_printf(seq, "%-127s\n", | |
1699 | " sl local_address rem_address st tx_queue " | |
1700 | "rx_queue tr tm->when retrnsmt uid timeout " | |
cb61cb9b | 1701 | "inode ref pointer drops"); |
db8dac20 | 1702 | else { |
db8dac20 | 1703 | struct udp_iter_state *state = seq->private; |
5e659e4c | 1704 | int len; |
db8dac20 | 1705 | |
5e659e4c PE |
1706 | udp4_format_sock(v, seq, state->bucket, &len); |
1707 | seq_printf(seq, "%*s\n", 127 - len ,""); | |
db8dac20 DM |
1708 | } |
1709 | return 0; | |
1710 | } | |
1711 | ||
1712 | /* ------------------------------------------------------------------------ */ | |
db8dac20 | 1713 | static struct udp_seq_afinfo udp4_seq_afinfo = { |
db8dac20 DM |
1714 | .name = "udp", |
1715 | .family = AF_INET, | |
645ca708 | 1716 | .udp_table = &udp_table, |
4ad96d39 DL |
1717 | .seq_fops = { |
1718 | .owner = THIS_MODULE, | |
1719 | }, | |
dda61925 DL |
1720 | .seq_ops = { |
1721 | .show = udp4_seq_show, | |
1722 | }, | |
db8dac20 DM |
1723 | }; |
1724 | ||
15439feb PE |
1725 | static int udp4_proc_init_net(struct net *net) |
1726 | { | |
1727 | return udp_proc_register(net, &udp4_seq_afinfo); | |
1728 | } | |
1729 | ||
1730 | static void udp4_proc_exit_net(struct net *net) | |
1731 | { | |
1732 | udp_proc_unregister(net, &udp4_seq_afinfo); | |
1733 | } | |
1734 | ||
1735 | static struct pernet_operations udp4_net_ops = { | |
1736 | .init = udp4_proc_init_net, | |
1737 | .exit = udp4_proc_exit_net, | |
1738 | }; | |
1739 | ||
db8dac20 DM |
1740 | int __init udp4_proc_init(void) |
1741 | { | |
15439feb | 1742 | return register_pernet_subsys(&udp4_net_ops); |
db8dac20 DM |
1743 | } |
1744 | ||
1745 | void udp4_proc_exit(void) | |
1746 | { | |
15439feb | 1747 | unregister_pernet_subsys(&udp4_net_ops); |
db8dac20 | 1748 | } |
1da177e4 LT |
1749 | #endif /* CONFIG_PROC_FS */ |
1750 | ||
645ca708 ED |
1751 | void __init udp_table_init(struct udp_table *table) |
1752 | { | |
1753 | int i; | |
1754 | ||
1755 | for (i = 0; i < UDP_HTABLE_SIZE; i++) { | |
1756 | INIT_HLIST_HEAD(&table->hash[i].head); | |
1757 | spin_lock_init(&table->hash[i].lock); | |
1758 | } | |
1759 | } | |
1760 | ||
95766fff HA |
1761 | void __init udp_init(void) |
1762 | { | |
8203efb3 | 1763 | unsigned long nr_pages, limit; |
95766fff | 1764 | |
645ca708 | 1765 | udp_table_init(&udp_table); |
95766fff HA |
1766 | /* Set the pressure threshold up by the same strategy of TCP. It is a |
1767 | * fraction of global memory that is up to 1/2 at 256 MB, decreasing | |
1768 | * toward zero with the amount of memory, with a floor of 128 pages. | |
1769 | */ | |
8203efb3 ED |
1770 | nr_pages = totalram_pages - totalhigh_pages; |
1771 | limit = min(nr_pages, 1UL<<(28-PAGE_SHIFT)) >> (20-PAGE_SHIFT); | |
1772 | limit = (limit * (nr_pages >> (20-PAGE_SHIFT))) >> (PAGE_SHIFT-11); | |
95766fff HA |
1773 | limit = max(limit, 128UL); |
1774 | sysctl_udp_mem[0] = limit / 4 * 3; | |
1775 | sysctl_udp_mem[1] = limit; | |
1776 | sysctl_udp_mem[2] = sysctl_udp_mem[0] * 2; | |
1777 | ||
1778 | sysctl_udp_rmem_min = SK_MEM_QUANTUM; | |
1779 | sysctl_udp_wmem_min = SK_MEM_QUANTUM; | |
1780 | } | |
1781 | ||
1da177e4 | 1782 | EXPORT_SYMBOL(udp_disconnect); |
1da177e4 | 1783 | EXPORT_SYMBOL(udp_ioctl); |
db8dac20 DM |
1784 | EXPORT_SYMBOL(udp_prot); |
1785 | EXPORT_SYMBOL(udp_sendmsg); | |
4c0a6cb0 GR |
1786 | EXPORT_SYMBOL(udp_lib_getsockopt); |
1787 | EXPORT_SYMBOL(udp_lib_setsockopt); | |
1da177e4 | 1788 | EXPORT_SYMBOL(udp_poll); |
6ba5a3c5 | 1789 | EXPORT_SYMBOL(udp_lib_get_port); |
1da177e4 LT |
1790 | |
1791 | #ifdef CONFIG_PROC_FS | |
1792 | EXPORT_SYMBOL(udp_proc_register); | |
1793 | EXPORT_SYMBOL(udp_proc_unregister); | |
1794 | #endif |