ASoC: Don't go through cache when applying WM5100 rev A updates
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / net / ipv4 / udp.c
blob5a65eeac1d29b8f4035314fb1db1dc403af1a428
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.
6 * The User Datagram Protocol (UDP).
8 * Authors: Ross Biro
9 * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
10 * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
11 * Alan Cox, <alan@lxorguk.ukuu.org.uk>
12 * Hirokazu Takahashi, <taka@valinux.co.jp>
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
21 * Alan Cox : Tidied select() semantics.
22 * Alan Cox : udp_err() fixed properly, also now
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
57 * for connect.
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
71 * James Chapman : Add L2TP encapsulation type.
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.
80 #include <asm/system.h>
81 #include <asm/uaccess.h>
82 #include <asm/ioctls.h>
83 #include <linux/bootmem.h>
84 #include <linux/highmem.h>
85 #include <linux/swap.h>
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>
91 #include <linux/igmp.h>
92 #include <linux/in.h>
93 #include <linux/errno.h>
94 #include <linux/timer.h>
95 #include <linux/mm.h>
96 #include <linux/inet.h>
97 #include <linux/netdevice.h>
98 #include <linux/slab.h>
99 #include <net/tcp_states.h>
100 #include <linux/skbuff.h>
101 #include <linux/proc_fs.h>
102 #include <linux/seq_file.h>
103 #include <net/net_namespace.h>
104 #include <net/icmp.h>
105 #include <net/route.h>
106 #include <net/checksum.h>
107 #include <net/xfrm.h>
108 #include <trace/events/udp.h>
109 #include "udp_impl.h"
111 struct udp_table udp_table __read_mostly;
112 EXPORT_SYMBOL(udp_table);
114 long sysctl_udp_mem[3] __read_mostly;
115 EXPORT_SYMBOL(sysctl_udp_mem);
117 int sysctl_udp_rmem_min __read_mostly;
118 EXPORT_SYMBOL(sysctl_udp_rmem_min);
120 int sysctl_udp_wmem_min __read_mostly;
121 EXPORT_SYMBOL(sysctl_udp_wmem_min);
123 atomic_long_t udp_memory_allocated;
124 EXPORT_SYMBOL(udp_memory_allocated);
126 #define MAX_UDP_PORTS 65536
127 #define PORTS_PER_CHAIN (MAX_UDP_PORTS / UDP_HTABLE_SIZE_MIN)
129 static int udp_lib_lport_inuse(struct net *net, __u16 num,
130 const struct udp_hslot *hslot,
131 unsigned long *bitmap,
132 struct sock *sk,
133 int (*saddr_comp)(const struct sock *sk1,
134 const struct sock *sk2),
135 unsigned int log)
137 struct sock *sk2;
138 struct hlist_nulls_node *node;
140 sk_nulls_for_each(sk2, node, &hslot->head)
141 if (net_eq(sock_net(sk2), net) &&
142 sk2 != sk &&
143 (bitmap || udp_sk(sk2)->udp_port_hash == num) &&
144 (!sk2->sk_reuse || !sk->sk_reuse) &&
145 (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if ||
146 sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
147 (*saddr_comp)(sk, sk2)) {
148 if (bitmap)
149 __set_bit(udp_sk(sk2)->udp_port_hash >> log,
150 bitmap);
151 else
152 return 1;
154 return 0;
158 * Note: we still hold spinlock of primary hash chain, so no other writer
159 * can insert/delete a socket with local_port == num
161 static int udp_lib_lport_inuse2(struct net *net, __u16 num,
162 struct udp_hslot *hslot2,
163 struct sock *sk,
164 int (*saddr_comp)(const struct sock *sk1,
165 const struct sock *sk2))
167 struct sock *sk2;
168 struct hlist_nulls_node *node;
169 int res = 0;
171 spin_lock(&hslot2->lock);
172 udp_portaddr_for_each_entry(sk2, node, &hslot2->head)
173 if (net_eq(sock_net(sk2), net) &&
174 sk2 != sk &&
175 (udp_sk(sk2)->udp_port_hash == num) &&
176 (!sk2->sk_reuse || !sk->sk_reuse) &&
177 (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if ||
178 sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
179 (*saddr_comp)(sk, sk2)) {
180 res = 1;
181 break;
183 spin_unlock(&hslot2->lock);
184 return res;
188 * udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
190 * @sk: socket struct in question
191 * @snum: port number to look up
192 * @saddr_comp: AF-dependent comparison of bound local IP addresses
193 * @hash2_nulladdr: AF-dependent hash value in secondary hash chains,
194 * with NULL address
196 int udp_lib_get_port(struct sock *sk, unsigned short snum,
197 int (*saddr_comp)(const struct sock *sk1,
198 const struct sock *sk2),
199 unsigned int hash2_nulladdr)
201 struct udp_hslot *hslot, *hslot2;
202 struct udp_table *udptable = sk->sk_prot->h.udp_table;
203 int error = 1;
204 struct net *net = sock_net(sk);
206 if (!snum) {
207 int low, high, remaining;
208 unsigned rand;
209 unsigned short first, last;
210 DECLARE_BITMAP(bitmap, PORTS_PER_CHAIN);
212 inet_get_local_port_range(&low, &high);
213 remaining = (high - low) + 1;
215 rand = net_random();
216 first = (((u64)rand * remaining) >> 32) + low;
218 * force rand to be an odd multiple of UDP_HTABLE_SIZE
220 rand = (rand | 1) * (udptable->mask + 1);
221 last = first + udptable->mask + 1;
222 do {
223 hslot = udp_hashslot(udptable, net, first);
224 bitmap_zero(bitmap, PORTS_PER_CHAIN);
225 spin_lock_bh(&hslot->lock);
226 udp_lib_lport_inuse(net, snum, hslot, bitmap, sk,
227 saddr_comp, udptable->log);
229 snum = first;
231 * Iterate on all possible values of snum for this hash.
232 * Using steps of an odd multiple of UDP_HTABLE_SIZE
233 * give us randomization and full range coverage.
235 do {
236 if (low <= snum && snum <= high &&
237 !test_bit(snum >> udptable->log, bitmap) &&
238 !inet_is_reserved_local_port(snum))
239 goto found;
240 snum += rand;
241 } while (snum != first);
242 spin_unlock_bh(&hslot->lock);
243 } while (++first != last);
244 goto fail;
245 } else {
246 hslot = udp_hashslot(udptable, net, snum);
247 spin_lock_bh(&hslot->lock);
248 if (hslot->count > 10) {
249 int exist;
250 unsigned int slot2 = udp_sk(sk)->udp_portaddr_hash ^ snum;
252 slot2 &= udptable->mask;
253 hash2_nulladdr &= udptable->mask;
255 hslot2 = udp_hashslot2(udptable, slot2);
256 if (hslot->count < hslot2->count)
257 goto scan_primary_hash;
259 exist = udp_lib_lport_inuse2(net, snum, hslot2,
260 sk, saddr_comp);
261 if (!exist && (hash2_nulladdr != slot2)) {
262 hslot2 = udp_hashslot2(udptable, hash2_nulladdr);
263 exist = udp_lib_lport_inuse2(net, snum, hslot2,
264 sk, saddr_comp);
266 if (exist)
267 goto fail_unlock;
268 else
269 goto found;
271 scan_primary_hash:
272 if (udp_lib_lport_inuse(net, snum, hslot, NULL, sk,
273 saddr_comp, 0))
274 goto fail_unlock;
276 found:
277 inet_sk(sk)->inet_num = snum;
278 udp_sk(sk)->udp_port_hash = snum;
279 udp_sk(sk)->udp_portaddr_hash ^= snum;
280 if (sk_unhashed(sk)) {
281 sk_nulls_add_node_rcu(sk, &hslot->head);
282 hslot->count++;
283 sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1);
285 hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
286 spin_lock(&hslot2->lock);
287 hlist_nulls_add_head_rcu(&udp_sk(sk)->udp_portaddr_node,
288 &hslot2->head);
289 hslot2->count++;
290 spin_unlock(&hslot2->lock);
292 error = 0;
293 fail_unlock:
294 spin_unlock_bh(&hslot->lock);
295 fail:
296 return error;
298 EXPORT_SYMBOL(udp_lib_get_port);
300 static int ipv4_rcv_saddr_equal(const struct sock *sk1, const struct sock *sk2)
302 struct inet_sock *inet1 = inet_sk(sk1), *inet2 = inet_sk(sk2);
304 return (!ipv6_only_sock(sk2) &&
305 (!inet1->inet_rcv_saddr || !inet2->inet_rcv_saddr ||
306 inet1->inet_rcv_saddr == inet2->inet_rcv_saddr));
309 static unsigned int udp4_portaddr_hash(struct net *net, __be32 saddr,
310 unsigned int port)
312 return jhash_1word((__force u32)saddr, net_hash_mix(net)) ^ port;
315 int udp_v4_get_port(struct sock *sk, unsigned short snum)
317 unsigned int hash2_nulladdr =
318 udp4_portaddr_hash(sock_net(sk), htonl(INADDR_ANY), snum);
319 unsigned int hash2_partial =
320 udp4_portaddr_hash(sock_net(sk), inet_sk(sk)->inet_rcv_saddr, 0);
322 /* precompute partial secondary hash */
323 udp_sk(sk)->udp_portaddr_hash = hash2_partial;
324 return udp_lib_get_port(sk, snum, ipv4_rcv_saddr_equal, hash2_nulladdr);
327 static inline int compute_score(struct sock *sk, struct net *net, __be32 saddr,
328 unsigned short hnum,
329 __be16 sport, __be32 daddr, __be16 dport, int dif)
331 int score = -1;
333 if (net_eq(sock_net(sk), net) && udp_sk(sk)->udp_port_hash == hnum &&
334 !ipv6_only_sock(sk)) {
335 struct inet_sock *inet = inet_sk(sk);
337 score = (sk->sk_family == PF_INET ? 1 : 0);
338 if (inet->inet_rcv_saddr) {
339 if (inet->inet_rcv_saddr != daddr)
340 return -1;
341 score += 2;
343 if (inet->inet_daddr) {
344 if (inet->inet_daddr != saddr)
345 return -1;
346 score += 2;
348 if (inet->inet_dport) {
349 if (inet->inet_dport != sport)
350 return -1;
351 score += 2;
353 if (sk->sk_bound_dev_if) {
354 if (sk->sk_bound_dev_if != dif)
355 return -1;
356 score += 2;
359 return score;
363 * In this second variant, we check (daddr, dport) matches (inet_rcv_sadd, inet_num)
365 #define SCORE2_MAX (1 + 2 + 2 + 2)
366 static inline int compute_score2(struct sock *sk, struct net *net,
367 __be32 saddr, __be16 sport,
368 __be32 daddr, unsigned int hnum, int dif)
370 int score = -1;
372 if (net_eq(sock_net(sk), net) && !ipv6_only_sock(sk)) {
373 struct inet_sock *inet = inet_sk(sk);
375 if (inet->inet_rcv_saddr != daddr)
376 return -1;
377 if (inet->inet_num != hnum)
378 return -1;
380 score = (sk->sk_family == PF_INET ? 1 : 0);
381 if (inet->inet_daddr) {
382 if (inet->inet_daddr != saddr)
383 return -1;
384 score += 2;
386 if (inet->inet_dport) {
387 if (inet->inet_dport != sport)
388 return -1;
389 score += 2;
391 if (sk->sk_bound_dev_if) {
392 if (sk->sk_bound_dev_if != dif)
393 return -1;
394 score += 2;
397 return score;
401 /* called with read_rcu_lock() */
402 static struct sock *udp4_lib_lookup2(struct net *net,
403 __be32 saddr, __be16 sport,
404 __be32 daddr, unsigned int hnum, int dif,
405 struct udp_hslot *hslot2, unsigned int slot2)
407 struct sock *sk, *result;
408 struct hlist_nulls_node *node;
409 int score, badness;
411 begin:
412 result = NULL;
413 badness = -1;
414 udp_portaddr_for_each_entry_rcu(sk, node, &hslot2->head) {
415 score = compute_score2(sk, net, saddr, sport,
416 daddr, hnum, dif);
417 if (score > badness) {
418 result = sk;
419 badness = score;
420 if (score == SCORE2_MAX)
421 goto exact_match;
425 * if the nulls value we got at the end of this lookup is
426 * not the expected one, we must restart lookup.
427 * We probably met an item that was moved to another chain.
429 if (get_nulls_value(node) != slot2)
430 goto begin;
432 if (result) {
433 exact_match:
434 if (unlikely(!atomic_inc_not_zero_hint(&result->sk_refcnt, 2)))
435 result = NULL;
436 else if (unlikely(compute_score2(result, net, saddr, sport,
437 daddr, hnum, dif) < badness)) {
438 sock_put(result);
439 goto begin;
442 return result;
445 /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
446 * harder than this. -DaveM
448 static struct sock *__udp4_lib_lookup(struct net *net, __be32 saddr,
449 __be16 sport, __be32 daddr, __be16 dport,
450 int dif, struct udp_table *udptable)
452 struct sock *sk, *result;
453 struct hlist_nulls_node *node;
454 unsigned short hnum = ntohs(dport);
455 unsigned int hash2, slot2, slot = udp_hashfn(net, hnum, udptable->mask);
456 struct udp_hslot *hslot2, *hslot = &udptable->hash[slot];
457 int score, badness;
459 rcu_read_lock();
460 if (hslot->count > 10) {
461 hash2 = udp4_portaddr_hash(net, daddr, hnum);
462 slot2 = hash2 & udptable->mask;
463 hslot2 = &udptable->hash2[slot2];
464 if (hslot->count < hslot2->count)
465 goto begin;
467 result = udp4_lib_lookup2(net, saddr, sport,
468 daddr, hnum, dif,
469 hslot2, slot2);
470 if (!result) {
471 hash2 = udp4_portaddr_hash(net, htonl(INADDR_ANY), hnum);
472 slot2 = hash2 & udptable->mask;
473 hslot2 = &udptable->hash2[slot2];
474 if (hslot->count < hslot2->count)
475 goto begin;
477 result = udp4_lib_lookup2(net, saddr, sport,
478 htonl(INADDR_ANY), hnum, dif,
479 hslot2, slot2);
481 rcu_read_unlock();
482 return result;
484 begin:
485 result = NULL;
486 badness = -1;
487 sk_nulls_for_each_rcu(sk, node, &hslot->head) {
488 score = compute_score(sk, net, saddr, hnum, sport,
489 daddr, dport, dif);
490 if (score > badness) {
491 result = sk;
492 badness = score;
496 * if the nulls value we got at the end of this lookup is
497 * not the expected one, we must restart lookup.
498 * We probably met an item that was moved to another chain.
500 if (get_nulls_value(node) != slot)
501 goto begin;
503 if (result) {
504 if (unlikely(!atomic_inc_not_zero_hint(&result->sk_refcnt, 2)))
505 result = NULL;
506 else if (unlikely(compute_score(result, net, saddr, hnum, sport,
507 daddr, dport, dif) < badness)) {
508 sock_put(result);
509 goto begin;
512 rcu_read_unlock();
513 return result;
516 static inline struct sock *__udp4_lib_lookup_skb(struct sk_buff *skb,
517 __be16 sport, __be16 dport,
518 struct udp_table *udptable)
520 struct sock *sk;
521 const struct iphdr *iph = ip_hdr(skb);
523 if (unlikely(sk = skb_steal_sock(skb)))
524 return sk;
525 else
526 return __udp4_lib_lookup(dev_net(skb_dst(skb)->dev), iph->saddr, sport,
527 iph->daddr, dport, inet_iif(skb),
528 udptable);
531 struct sock *udp4_lib_lookup(struct net *net, __be32 saddr, __be16 sport,
532 __be32 daddr, __be16 dport, int dif)
534 return __udp4_lib_lookup(net, saddr, sport, daddr, dport, dif, &udp_table);
536 EXPORT_SYMBOL_GPL(udp4_lib_lookup);
538 static inline struct sock *udp_v4_mcast_next(struct net *net, struct sock *sk,
539 __be16 loc_port, __be32 loc_addr,
540 __be16 rmt_port, __be32 rmt_addr,
541 int dif)
543 struct hlist_nulls_node *node;
544 struct sock *s = sk;
545 unsigned short hnum = ntohs(loc_port);
547 sk_nulls_for_each_from(s, node) {
548 struct inet_sock *inet = inet_sk(s);
550 if (!net_eq(sock_net(s), net) ||
551 udp_sk(s)->udp_port_hash != hnum ||
552 (inet->inet_daddr && inet->inet_daddr != rmt_addr) ||
553 (inet->inet_dport != rmt_port && inet->inet_dport) ||
554 (inet->inet_rcv_saddr &&
555 inet->inet_rcv_saddr != loc_addr) ||
556 ipv6_only_sock(s) ||
557 (s->sk_bound_dev_if && s->sk_bound_dev_if != dif))
558 continue;
559 if (!ip_mc_sf_allow(s, loc_addr, rmt_addr, dif))
560 continue;
561 goto found;
563 s = NULL;
564 found:
565 return s;
569 * This routine is called by the ICMP module when it gets some
570 * sort of error condition. If err < 0 then the socket should
571 * be closed and the error returned to the user. If err > 0
572 * it's just the icmp type << 8 | icmp code.
573 * Header points to the ip header of the error packet. We move
574 * on past this. Then (as it used to claim before adjustment)
575 * header points to the first 8 bytes of the udp header. We need
576 * to find the appropriate port.
579 void __udp4_lib_err(struct sk_buff *skb, u32 info, struct udp_table *udptable)
581 struct inet_sock *inet;
582 const struct iphdr *iph = (const struct iphdr *)skb->data;
583 struct udphdr *uh = (struct udphdr *)(skb->data+(iph->ihl<<2));
584 const int type = icmp_hdr(skb)->type;
585 const int code = icmp_hdr(skb)->code;
586 struct sock *sk;
587 int harderr;
588 int err;
589 struct net *net = dev_net(skb->dev);
591 sk = __udp4_lib_lookup(net, iph->daddr, uh->dest,
592 iph->saddr, uh->source, skb->dev->ifindex, udptable);
593 if (sk == NULL) {
594 ICMP_INC_STATS_BH(net, ICMP_MIB_INERRORS);
595 return; /* No socket for error */
598 err = 0;
599 harderr = 0;
600 inet = inet_sk(sk);
602 switch (type) {
603 default:
604 case ICMP_TIME_EXCEEDED:
605 err = EHOSTUNREACH;
606 break;
607 case ICMP_SOURCE_QUENCH:
608 goto out;
609 case ICMP_PARAMETERPROB:
610 err = EPROTO;
611 harderr = 1;
612 break;
613 case ICMP_DEST_UNREACH:
614 if (code == ICMP_FRAG_NEEDED) { /* Path MTU discovery */
615 if (inet->pmtudisc != IP_PMTUDISC_DONT) {
616 err = EMSGSIZE;
617 harderr = 1;
618 break;
620 goto out;
622 err = EHOSTUNREACH;
623 if (code <= NR_ICMP_UNREACH) {
624 harderr = icmp_err_convert[code].fatal;
625 err = icmp_err_convert[code].errno;
627 break;
631 * RFC1122: OK. Passes ICMP errors back to application, as per
632 * 4.1.3.3.
634 if (!inet->recverr) {
635 if (!harderr || sk->sk_state != TCP_ESTABLISHED)
636 goto out;
637 } else
638 ip_icmp_error(sk, skb, err, uh->dest, info, (u8 *)(uh+1));
640 sk->sk_err = err;
641 sk->sk_error_report(sk);
642 out:
643 sock_put(sk);
646 void udp_err(struct sk_buff *skb, u32 info)
648 __udp4_lib_err(skb, info, &udp_table);
652 * Throw away all pending data and cancel the corking. Socket is locked.
654 void udp_flush_pending_frames(struct sock *sk)
656 struct udp_sock *up = udp_sk(sk);
658 if (up->pending) {
659 up->len = 0;
660 up->pending = 0;
661 ip_flush_pending_frames(sk);
664 EXPORT_SYMBOL(udp_flush_pending_frames);
667 * udp4_hwcsum - handle outgoing HW checksumming
668 * @skb: sk_buff containing the filled-in UDP header
669 * (checksum field must be zeroed out)
670 * @src: source IP address
671 * @dst: destination IP address
673 static void udp4_hwcsum(struct sk_buff *skb, __be32 src, __be32 dst)
675 struct udphdr *uh = udp_hdr(skb);
676 struct sk_buff *frags = skb_shinfo(skb)->frag_list;
677 int offset = skb_transport_offset(skb);
678 int len = skb->len - offset;
679 int hlen = len;
680 __wsum csum = 0;
682 if (!frags) {
684 * Only one fragment on the socket.
686 skb->csum_start = skb_transport_header(skb) - skb->head;
687 skb->csum_offset = offsetof(struct udphdr, check);
688 uh->check = ~csum_tcpudp_magic(src, dst, len,
689 IPPROTO_UDP, 0);
690 } else {
692 * HW-checksum won't work as there are two or more
693 * fragments on the socket so that all csums of sk_buffs
694 * should be together
696 do {
697 csum = csum_add(csum, frags->csum);
698 hlen -= frags->len;
699 } while ((frags = frags->next));
701 csum = skb_checksum(skb, offset, hlen, csum);
702 skb->ip_summed = CHECKSUM_NONE;
704 uh->check = csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, csum);
705 if (uh->check == 0)
706 uh->check = CSUM_MANGLED_0;
710 static int udp_send_skb(struct sk_buff *skb, struct flowi4 *fl4)
712 struct sock *sk = skb->sk;
713 struct inet_sock *inet = inet_sk(sk);
714 struct udphdr *uh;
715 int err = 0;
716 int is_udplite = IS_UDPLITE(sk);
717 int offset = skb_transport_offset(skb);
718 int len = skb->len - offset;
719 __wsum csum = 0;
722 * Create a UDP header
724 uh = udp_hdr(skb);
725 uh->source = inet->inet_sport;
726 uh->dest = fl4->fl4_dport;
727 uh->len = htons(len);
728 uh->check = 0;
730 if (is_udplite) /* UDP-Lite */
731 csum = udplite_csum(skb);
733 else if (sk->sk_no_check == UDP_CSUM_NOXMIT) { /* UDP csum disabled */
735 skb->ip_summed = CHECKSUM_NONE;
736 goto send;
738 } else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */
740 udp4_hwcsum(skb, fl4->saddr, fl4->daddr);
741 goto send;
743 } else
744 csum = udp_csum(skb);
746 /* add protocol-dependent pseudo-header */
747 uh->check = csum_tcpudp_magic(fl4->saddr, fl4->daddr, len,
748 sk->sk_protocol, csum);
749 if (uh->check == 0)
750 uh->check = CSUM_MANGLED_0;
752 send:
753 err = ip_send_skb(skb);
754 if (err) {
755 if (err == -ENOBUFS && !inet->recverr) {
756 UDP_INC_STATS_USER(sock_net(sk),
757 UDP_MIB_SNDBUFERRORS, is_udplite);
758 err = 0;
760 } else
761 UDP_INC_STATS_USER(sock_net(sk),
762 UDP_MIB_OUTDATAGRAMS, is_udplite);
763 return err;
767 * Push out all pending data as one UDP datagram. Socket is locked.
769 static int udp_push_pending_frames(struct sock *sk)
771 struct udp_sock *up = udp_sk(sk);
772 struct inet_sock *inet = inet_sk(sk);
773 struct flowi4 *fl4 = &inet->cork.fl.u.ip4;
774 struct sk_buff *skb;
775 int err = 0;
777 skb = ip_finish_skb(sk, fl4);
778 if (!skb)
779 goto out;
781 err = udp_send_skb(skb, fl4);
783 out:
784 up->len = 0;
785 up->pending = 0;
786 return err;
789 int udp_sendmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
790 size_t len)
792 struct inet_sock *inet = inet_sk(sk);
793 struct udp_sock *up = udp_sk(sk);
794 struct flowi4 fl4_stack;
795 struct flowi4 *fl4;
796 int ulen = len;
797 struct ipcm_cookie ipc;
798 struct rtable *rt = NULL;
799 int free = 0;
800 int connected = 0;
801 __be32 daddr, faddr, saddr;
802 __be16 dport;
803 u8 tos;
804 int err, is_udplite = IS_UDPLITE(sk);
805 int corkreq = up->corkflag || msg->msg_flags&MSG_MORE;
806 int (*getfrag)(void *, char *, int, int, int, struct sk_buff *);
807 struct sk_buff *skb;
808 struct ip_options_data opt_copy;
810 if (len > 0xFFFF)
811 return -EMSGSIZE;
814 * Check the flags.
817 if (msg->msg_flags & MSG_OOB) /* Mirror BSD error message compatibility */
818 return -EOPNOTSUPP;
820 ipc.opt = NULL;
821 ipc.tx_flags = 0;
823 getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag;
825 fl4 = &inet->cork.fl.u.ip4;
826 if (up->pending) {
828 * There are pending frames.
829 * The socket lock must be held while it's corked.
831 lock_sock(sk);
832 if (likely(up->pending)) {
833 if (unlikely(up->pending != AF_INET)) {
834 release_sock(sk);
835 return -EINVAL;
837 goto do_append_data;
839 release_sock(sk);
841 ulen += sizeof(struct udphdr);
844 * Get and verify the address.
846 if (msg->msg_name) {
847 struct sockaddr_in * usin = (struct sockaddr_in *)msg->msg_name;
848 if (msg->msg_namelen < sizeof(*usin))
849 return -EINVAL;
850 if (usin->sin_family != AF_INET) {
851 if (usin->sin_family != AF_UNSPEC)
852 return -EAFNOSUPPORT;
855 daddr = usin->sin_addr.s_addr;
856 dport = usin->sin_port;
857 if (dport == 0)
858 return -EINVAL;
859 } else {
860 if (sk->sk_state != TCP_ESTABLISHED)
861 return -EDESTADDRREQ;
862 daddr = inet->inet_daddr;
863 dport = inet->inet_dport;
864 /* Open fast path for connected socket.
865 Route will not be used, if at least one option is set.
867 connected = 1;
869 ipc.addr = inet->inet_saddr;
871 ipc.oif = sk->sk_bound_dev_if;
872 err = sock_tx_timestamp(sk, &ipc.tx_flags);
873 if (err)
874 return err;
875 if (msg->msg_controllen) {
876 err = ip_cmsg_send(sock_net(sk), msg, &ipc);
877 if (err)
878 return err;
879 if (ipc.opt)
880 free = 1;
881 connected = 0;
883 if (!ipc.opt) {
884 struct ip_options_rcu *inet_opt;
886 rcu_read_lock();
887 inet_opt = rcu_dereference(inet->inet_opt);
888 if (inet_opt) {
889 memcpy(&opt_copy, inet_opt,
890 sizeof(*inet_opt) + inet_opt->opt.optlen);
891 ipc.opt = &opt_copy.opt;
893 rcu_read_unlock();
896 saddr = ipc.addr;
897 ipc.addr = faddr = daddr;
899 if (ipc.opt && ipc.opt->opt.srr) {
900 if (!daddr)
901 return -EINVAL;
902 faddr = ipc.opt->opt.faddr;
903 connected = 0;
905 tos = RT_TOS(inet->tos);
906 if (sock_flag(sk, SOCK_LOCALROUTE) ||
907 (msg->msg_flags & MSG_DONTROUTE) ||
908 (ipc.opt && ipc.opt->opt.is_strictroute)) {
909 tos |= RTO_ONLINK;
910 connected = 0;
913 if (ipv4_is_multicast(daddr)) {
914 if (!ipc.oif)
915 ipc.oif = inet->mc_index;
916 if (!saddr)
917 saddr = inet->mc_addr;
918 connected = 0;
921 if (connected)
922 rt = (struct rtable *)sk_dst_check(sk, 0);
924 if (rt == NULL) {
925 struct net *net = sock_net(sk);
927 fl4 = &fl4_stack;
928 flowi4_init_output(fl4, ipc.oif, sk->sk_mark, tos,
929 RT_SCOPE_UNIVERSE, sk->sk_protocol,
930 inet_sk_flowi_flags(sk)|FLOWI_FLAG_CAN_SLEEP,
931 faddr, saddr, dport, inet->inet_sport);
933 security_sk_classify_flow(sk, flowi4_to_flowi(fl4));
934 rt = ip_route_output_flow(net, fl4, sk);
935 if (IS_ERR(rt)) {
936 err = PTR_ERR(rt);
937 rt = NULL;
938 if (err == -ENETUNREACH)
939 IP_INC_STATS_BH(net, IPSTATS_MIB_OUTNOROUTES);
940 goto out;
943 err = -EACCES;
944 if ((rt->rt_flags & RTCF_BROADCAST) &&
945 !sock_flag(sk, SOCK_BROADCAST))
946 goto out;
947 if (connected)
948 sk_dst_set(sk, dst_clone(&rt->dst));
951 if (msg->msg_flags&MSG_CONFIRM)
952 goto do_confirm;
953 back_from_confirm:
955 saddr = fl4->saddr;
956 if (!ipc.addr)
957 daddr = ipc.addr = fl4->daddr;
959 /* Lockless fast path for the non-corking case. */
960 if (!corkreq) {
961 skb = ip_make_skb(sk, fl4, getfrag, msg->msg_iov, ulen,
962 sizeof(struct udphdr), &ipc, &rt,
963 msg->msg_flags);
964 err = PTR_ERR(skb);
965 if (skb && !IS_ERR(skb))
966 err = udp_send_skb(skb, fl4);
967 goto out;
970 lock_sock(sk);
971 if (unlikely(up->pending)) {
972 /* The socket is already corked while preparing it. */
973 /* ... which is an evident application bug. --ANK */
974 release_sock(sk);
976 LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 2\n");
977 err = -EINVAL;
978 goto out;
981 * Now cork the socket to pend data.
983 fl4 = &inet->cork.fl.u.ip4;
984 fl4->daddr = daddr;
985 fl4->saddr = saddr;
986 fl4->fl4_dport = dport;
987 fl4->fl4_sport = inet->inet_sport;
988 up->pending = AF_INET;
990 do_append_data:
991 up->len += ulen;
992 err = ip_append_data(sk, fl4, getfrag, msg->msg_iov, ulen,
993 sizeof(struct udphdr), &ipc, &rt,
994 corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags);
995 if (err)
996 udp_flush_pending_frames(sk);
997 else if (!corkreq)
998 err = udp_push_pending_frames(sk);
999 else if (unlikely(skb_queue_empty(&sk->sk_write_queue)))
1000 up->pending = 0;
1001 release_sock(sk);
1003 out:
1004 ip_rt_put(rt);
1005 if (free)
1006 kfree(ipc.opt);
1007 if (!err)
1008 return len;
1010 * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
1011 * ENOBUFS might not be good (it's not tunable per se), but otherwise
1012 * we don't have a good statistic (IpOutDiscards but it can be too many
1013 * things). We could add another new stat but at least for now that
1014 * seems like overkill.
1016 if (err == -ENOBUFS || test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
1017 UDP_INC_STATS_USER(sock_net(sk),
1018 UDP_MIB_SNDBUFERRORS, is_udplite);
1020 return err;
1022 do_confirm:
1023 dst_confirm(&rt->dst);
1024 if (!(msg->msg_flags&MSG_PROBE) || len)
1025 goto back_from_confirm;
1026 err = 0;
1027 goto out;
1029 EXPORT_SYMBOL(udp_sendmsg);
1031 int udp_sendpage(struct sock *sk, struct page *page, int offset,
1032 size_t size, int flags)
1034 struct inet_sock *inet = inet_sk(sk);
1035 struct udp_sock *up = udp_sk(sk);
1036 int ret;
1038 if (!up->pending) {
1039 struct msghdr msg = { .msg_flags = flags|MSG_MORE };
1041 /* Call udp_sendmsg to specify destination address which
1042 * sendpage interface can't pass.
1043 * This will succeed only when the socket is connected.
1045 ret = udp_sendmsg(NULL, sk, &msg, 0);
1046 if (ret < 0)
1047 return ret;
1050 lock_sock(sk);
1052 if (unlikely(!up->pending)) {
1053 release_sock(sk);
1055 LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 3\n");
1056 return -EINVAL;
1059 ret = ip_append_page(sk, &inet->cork.fl.u.ip4,
1060 page, offset, size, flags);
1061 if (ret == -EOPNOTSUPP) {
1062 release_sock(sk);
1063 return sock_no_sendpage(sk->sk_socket, page, offset,
1064 size, flags);
1066 if (ret < 0) {
1067 udp_flush_pending_frames(sk);
1068 goto out;
1071 up->len += size;
1072 if (!(up->corkflag || (flags&MSG_MORE)))
1073 ret = udp_push_pending_frames(sk);
1074 if (!ret)
1075 ret = size;
1076 out:
1077 release_sock(sk);
1078 return ret;
1083 * first_packet_length - return length of first packet in receive queue
1084 * @sk: socket
1086 * Drops all bad checksum frames, until a valid one is found.
1087 * Returns the length of found skb, or 0 if none is found.
1089 static unsigned int first_packet_length(struct sock *sk)
1091 struct sk_buff_head list_kill, *rcvq = &sk->sk_receive_queue;
1092 struct sk_buff *skb;
1093 unsigned int res;
1095 __skb_queue_head_init(&list_kill);
1097 spin_lock_bh(&rcvq->lock);
1098 while ((skb = skb_peek(rcvq)) != NULL &&
1099 udp_lib_checksum_complete(skb)) {
1100 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS,
1101 IS_UDPLITE(sk));
1102 atomic_inc(&sk->sk_drops);
1103 __skb_unlink(skb, rcvq);
1104 __skb_queue_tail(&list_kill, skb);
1106 res = skb ? skb->len : 0;
1107 spin_unlock_bh(&rcvq->lock);
1109 if (!skb_queue_empty(&list_kill)) {
1110 bool slow = lock_sock_fast(sk);
1112 __skb_queue_purge(&list_kill);
1113 sk_mem_reclaim_partial(sk);
1114 unlock_sock_fast(sk, slow);
1116 return res;
1120 * IOCTL requests applicable to the UDP protocol
1123 int udp_ioctl(struct sock *sk, int cmd, unsigned long arg)
1125 switch (cmd) {
1126 case SIOCOUTQ:
1128 int amount = sk_wmem_alloc_get(sk);
1130 return put_user(amount, (int __user *)arg);
1133 case SIOCINQ:
1135 unsigned int amount = first_packet_length(sk);
1137 if (amount)
1139 * We will only return the amount
1140 * of this packet since that is all
1141 * that will be read.
1143 amount -= sizeof(struct udphdr);
1145 return put_user(amount, (int __user *)arg);
1148 default:
1149 return -ENOIOCTLCMD;
1152 return 0;
1154 EXPORT_SYMBOL(udp_ioctl);
1157 * This should be easy, if there is something there we
1158 * return it, otherwise we block.
1161 int udp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
1162 size_t len, int noblock, int flags, int *addr_len)
1164 struct inet_sock *inet = inet_sk(sk);
1165 struct sockaddr_in *sin = (struct sockaddr_in *)msg->msg_name;
1166 struct sk_buff *skb;
1167 unsigned int ulen, copied;
1168 int peeked;
1169 int err;
1170 int is_udplite = IS_UDPLITE(sk);
1171 bool slow;
1174 * Check any passed addresses
1176 if (addr_len)
1177 *addr_len = sizeof(*sin);
1179 if (flags & MSG_ERRQUEUE)
1180 return ip_recv_error(sk, msg, len);
1182 try_again:
1183 skb = __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0),
1184 &peeked, &err);
1185 if (!skb)
1186 goto out;
1188 ulen = skb->len - sizeof(struct udphdr);
1189 copied = len;
1190 if (copied > ulen)
1191 copied = ulen;
1192 else if (copied < ulen)
1193 msg->msg_flags |= MSG_TRUNC;
1196 * If checksum is needed at all, try to do it while copying the
1197 * data. If the data is truncated, or if we only want a partial
1198 * coverage checksum (UDP-Lite), do it before the copy.
1201 if (copied < ulen || UDP_SKB_CB(skb)->partial_cov) {
1202 if (udp_lib_checksum_complete(skb))
1203 goto csum_copy_err;
1206 if (skb_csum_unnecessary(skb))
1207 err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr),
1208 msg->msg_iov, copied);
1209 else {
1210 err = skb_copy_and_csum_datagram_iovec(skb,
1211 sizeof(struct udphdr),
1212 msg->msg_iov);
1214 if (err == -EINVAL)
1215 goto csum_copy_err;
1218 if (err)
1219 goto out_free;
1221 if (!peeked)
1222 UDP_INC_STATS_USER(sock_net(sk),
1223 UDP_MIB_INDATAGRAMS, is_udplite);
1225 sock_recv_ts_and_drops(msg, sk, skb);
1227 /* Copy the address. */
1228 if (sin) {
1229 sin->sin_family = AF_INET;
1230 sin->sin_port = udp_hdr(skb)->source;
1231 sin->sin_addr.s_addr = ip_hdr(skb)->saddr;
1232 memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
1234 if (inet->cmsg_flags)
1235 ip_cmsg_recv(msg, skb);
1237 err = copied;
1238 if (flags & MSG_TRUNC)
1239 err = ulen;
1241 out_free:
1242 skb_free_datagram_locked(sk, skb);
1243 out:
1244 return err;
1246 csum_copy_err:
1247 slow = lock_sock_fast(sk);
1248 if (!skb_kill_datagram(sk, skb, flags))
1249 UDP_INC_STATS_USER(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1250 unlock_sock_fast(sk, slow);
1252 if (noblock)
1253 return -EAGAIN;
1255 /* starting over for a new packet */
1256 msg->msg_flags &= ~MSG_TRUNC;
1257 goto try_again;
1261 int udp_disconnect(struct sock *sk, int flags)
1263 struct inet_sock *inet = inet_sk(sk);
1265 * 1003.1g - break association.
1268 sk->sk_state = TCP_CLOSE;
1269 inet->inet_daddr = 0;
1270 inet->inet_dport = 0;
1271 sock_rps_reset_rxhash(sk);
1272 sk->sk_bound_dev_if = 0;
1273 if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
1274 inet_reset_saddr(sk);
1276 if (!(sk->sk_userlocks & SOCK_BINDPORT_LOCK)) {
1277 sk->sk_prot->unhash(sk);
1278 inet->inet_sport = 0;
1280 sk_dst_reset(sk);
1281 return 0;
1283 EXPORT_SYMBOL(udp_disconnect);
1285 void udp_lib_unhash(struct sock *sk)
1287 if (sk_hashed(sk)) {
1288 struct udp_table *udptable = sk->sk_prot->h.udp_table;
1289 struct udp_hslot *hslot, *hslot2;
1291 hslot = udp_hashslot(udptable, sock_net(sk),
1292 udp_sk(sk)->udp_port_hash);
1293 hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
1295 spin_lock_bh(&hslot->lock);
1296 if (sk_nulls_del_node_init_rcu(sk)) {
1297 hslot->count--;
1298 inet_sk(sk)->inet_num = 0;
1299 sock_prot_inuse_add(sock_net(sk), sk->sk_prot, -1);
1301 spin_lock(&hslot2->lock);
1302 hlist_nulls_del_init_rcu(&udp_sk(sk)->udp_portaddr_node);
1303 hslot2->count--;
1304 spin_unlock(&hslot2->lock);
1306 spin_unlock_bh(&hslot->lock);
1309 EXPORT_SYMBOL(udp_lib_unhash);
1312 * inet_rcv_saddr was changed, we must rehash secondary hash
1314 void udp_lib_rehash(struct sock *sk, u16 newhash)
1316 if (sk_hashed(sk)) {
1317 struct udp_table *udptable = sk->sk_prot->h.udp_table;
1318 struct udp_hslot *hslot, *hslot2, *nhslot2;
1320 hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
1321 nhslot2 = udp_hashslot2(udptable, newhash);
1322 udp_sk(sk)->udp_portaddr_hash = newhash;
1323 if (hslot2 != nhslot2) {
1324 hslot = udp_hashslot(udptable, sock_net(sk),
1325 udp_sk(sk)->udp_port_hash);
1326 /* we must lock primary chain too */
1327 spin_lock_bh(&hslot->lock);
1329 spin_lock(&hslot2->lock);
1330 hlist_nulls_del_init_rcu(&udp_sk(sk)->udp_portaddr_node);
1331 hslot2->count--;
1332 spin_unlock(&hslot2->lock);
1334 spin_lock(&nhslot2->lock);
1335 hlist_nulls_add_head_rcu(&udp_sk(sk)->udp_portaddr_node,
1336 &nhslot2->head);
1337 nhslot2->count++;
1338 spin_unlock(&nhslot2->lock);
1340 spin_unlock_bh(&hslot->lock);
1344 EXPORT_SYMBOL(udp_lib_rehash);
1346 static void udp_v4_rehash(struct sock *sk)
1348 u16 new_hash = udp4_portaddr_hash(sock_net(sk),
1349 inet_sk(sk)->inet_rcv_saddr,
1350 inet_sk(sk)->inet_num);
1351 udp_lib_rehash(sk, new_hash);
1354 static int __udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
1356 int rc;
1358 if (inet_sk(sk)->inet_daddr)
1359 sock_rps_save_rxhash(sk, skb);
1361 rc = ip_queue_rcv_skb(sk, skb);
1362 if (rc < 0) {
1363 int is_udplite = IS_UDPLITE(sk);
1365 /* Note that an ENOMEM error is charged twice */
1366 if (rc == -ENOMEM)
1367 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
1368 is_udplite);
1369 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1370 kfree_skb(skb);
1371 trace_udp_fail_queue_rcv_skb(rc, sk);
1372 return -1;
1375 return 0;
1379 /* returns:
1380 * -1: error
1381 * 0: success
1382 * >0: "udp encap" protocol resubmission
1384 * Note that in the success and error cases, the skb is assumed to
1385 * have either been requeued or freed.
1387 int udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
1389 struct udp_sock *up = udp_sk(sk);
1390 int rc;
1391 int is_udplite = IS_UDPLITE(sk);
1394 * Charge it to the socket, dropping if the queue is full.
1396 if (!xfrm4_policy_check(sk, XFRM_POLICY_IN, skb))
1397 goto drop;
1398 nf_reset(skb);
1400 if (up->encap_type) {
1401 int (*encap_rcv)(struct sock *sk, struct sk_buff *skb);
1404 * This is an encapsulation socket so pass the skb to
1405 * the socket's udp_encap_rcv() hook. Otherwise, just
1406 * fall through and pass this up the UDP socket.
1407 * up->encap_rcv() returns the following value:
1408 * =0 if skb was successfully passed to the encap
1409 * handler or was discarded by it.
1410 * >0 if skb should be passed on to UDP.
1411 * <0 if skb should be resubmitted as proto -N
1414 /* if we're overly short, let UDP handle it */
1415 encap_rcv = ACCESS_ONCE(up->encap_rcv);
1416 if (skb->len > sizeof(struct udphdr) && encap_rcv != NULL) {
1417 int ret;
1419 ret = encap_rcv(sk, skb);
1420 if (ret <= 0) {
1421 UDP_INC_STATS_BH(sock_net(sk),
1422 UDP_MIB_INDATAGRAMS,
1423 is_udplite);
1424 return -ret;
1428 /* FALLTHROUGH -- it's a UDP Packet */
1432 * UDP-Lite specific tests, ignored on UDP sockets
1434 if ((is_udplite & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) {
1437 * MIB statistics other than incrementing the error count are
1438 * disabled for the following two types of errors: these depend
1439 * on the application settings, not on the functioning of the
1440 * protocol stack as such.
1442 * RFC 3828 here recommends (sec 3.3): "There should also be a
1443 * way ... to ... at least let the receiving application block
1444 * delivery of packets with coverage values less than a value
1445 * provided by the application."
1447 if (up->pcrlen == 0) { /* full coverage was set */
1448 LIMIT_NETDEBUG(KERN_WARNING "UDPLITE: partial coverage "
1449 "%d while full coverage %d requested\n",
1450 UDP_SKB_CB(skb)->cscov, skb->len);
1451 goto drop;
1453 /* The next case involves violating the min. coverage requested
1454 * by the receiver. This is subtle: if receiver wants x and x is
1455 * greater than the buffersize/MTU then receiver will complain
1456 * that it wants x while sender emits packets of smaller size y.
1457 * Therefore the above ...()->partial_cov statement is essential.
1459 if (UDP_SKB_CB(skb)->cscov < up->pcrlen) {
1460 LIMIT_NETDEBUG(KERN_WARNING
1461 "UDPLITE: coverage %d too small, need min %d\n",
1462 UDP_SKB_CB(skb)->cscov, up->pcrlen);
1463 goto drop;
1467 if (rcu_access_pointer(sk->sk_filter) &&
1468 udp_lib_checksum_complete(skb))
1469 goto drop;
1472 if (sk_rcvqueues_full(sk, skb))
1473 goto drop;
1475 rc = 0;
1477 bh_lock_sock(sk);
1478 if (!sock_owned_by_user(sk))
1479 rc = __udp_queue_rcv_skb(sk, skb);
1480 else if (sk_add_backlog(sk, skb)) {
1481 bh_unlock_sock(sk);
1482 goto drop;
1484 bh_unlock_sock(sk);
1486 return rc;
1488 drop:
1489 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1490 atomic_inc(&sk->sk_drops);
1491 kfree_skb(skb);
1492 return -1;
1496 static void flush_stack(struct sock **stack, unsigned int count,
1497 struct sk_buff *skb, unsigned int final)
1499 unsigned int i;
1500 struct sk_buff *skb1 = NULL;
1501 struct sock *sk;
1503 for (i = 0; i < count; i++) {
1504 sk = stack[i];
1505 if (likely(skb1 == NULL))
1506 skb1 = (i == final) ? skb : skb_clone(skb, GFP_ATOMIC);
1508 if (!skb1) {
1509 atomic_inc(&sk->sk_drops);
1510 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
1511 IS_UDPLITE(sk));
1512 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS,
1513 IS_UDPLITE(sk));
1516 if (skb1 && udp_queue_rcv_skb(sk, skb1) <= 0)
1517 skb1 = NULL;
1519 if (unlikely(skb1))
1520 kfree_skb(skb1);
1524 * Multicasts and broadcasts go to each listener.
1526 * Note: called only from the BH handler context.
1528 static int __udp4_lib_mcast_deliver(struct net *net, struct sk_buff *skb,
1529 struct udphdr *uh,
1530 __be32 saddr, __be32 daddr,
1531 struct udp_table *udptable)
1533 struct sock *sk, *stack[256 / sizeof(struct sock *)];
1534 struct udp_hslot *hslot = udp_hashslot(udptable, net, ntohs(uh->dest));
1535 int dif;
1536 unsigned int i, count = 0;
1538 spin_lock(&hslot->lock);
1539 sk = sk_nulls_head(&hslot->head);
1540 dif = skb->dev->ifindex;
1541 sk = udp_v4_mcast_next(net, sk, uh->dest, daddr, uh->source, saddr, dif);
1542 while (sk) {
1543 stack[count++] = sk;
1544 sk = udp_v4_mcast_next(net, sk_nulls_next(sk), uh->dest,
1545 daddr, uh->source, saddr, dif);
1546 if (unlikely(count == ARRAY_SIZE(stack))) {
1547 if (!sk)
1548 break;
1549 flush_stack(stack, count, skb, ~0);
1550 count = 0;
1554 * before releasing chain lock, we must take a reference on sockets
1556 for (i = 0; i < count; i++)
1557 sock_hold(stack[i]);
1559 spin_unlock(&hslot->lock);
1562 * do the slow work with no lock held
1564 if (count) {
1565 flush_stack(stack, count, skb, count - 1);
1567 for (i = 0; i < count; i++)
1568 sock_put(stack[i]);
1569 } else {
1570 kfree_skb(skb);
1572 return 0;
1575 /* Initialize UDP checksum. If exited with zero value (success),
1576 * CHECKSUM_UNNECESSARY means, that no more checks are required.
1577 * Otherwise, csum completion requires chacksumming packet body,
1578 * including udp header and folding it to skb->csum.
1580 static inline int udp4_csum_init(struct sk_buff *skb, struct udphdr *uh,
1581 int proto)
1583 const struct iphdr *iph;
1584 int err;
1586 UDP_SKB_CB(skb)->partial_cov = 0;
1587 UDP_SKB_CB(skb)->cscov = skb->len;
1589 if (proto == IPPROTO_UDPLITE) {
1590 err = udplite_checksum_init(skb, uh);
1591 if (err)
1592 return err;
1595 iph = ip_hdr(skb);
1596 if (uh->check == 0) {
1597 skb->ip_summed = CHECKSUM_UNNECESSARY;
1598 } else if (skb->ip_summed == CHECKSUM_COMPLETE) {
1599 if (!csum_tcpudp_magic(iph->saddr, iph->daddr, skb->len,
1600 proto, skb->csum))
1601 skb->ip_summed = CHECKSUM_UNNECESSARY;
1603 if (!skb_csum_unnecessary(skb))
1604 skb->csum = csum_tcpudp_nofold(iph->saddr, iph->daddr,
1605 skb->len, proto, 0);
1606 /* Probably, we should checksum udp header (it should be in cache
1607 * in any case) and data in tiny packets (< rx copybreak).
1610 return 0;
1614 * All we need to do is get the socket, and then do a checksum.
1617 int __udp4_lib_rcv(struct sk_buff *skb, struct udp_table *udptable,
1618 int proto)
1620 struct sock *sk;
1621 struct udphdr *uh;
1622 unsigned short ulen;
1623 struct rtable *rt = skb_rtable(skb);
1624 __be32 saddr, daddr;
1625 struct net *net = dev_net(skb->dev);
1628 * Validate the packet.
1630 if (!pskb_may_pull(skb, sizeof(struct udphdr)))
1631 goto drop; /* No space for header. */
1633 uh = udp_hdr(skb);
1634 ulen = ntohs(uh->len);
1635 saddr = ip_hdr(skb)->saddr;
1636 daddr = ip_hdr(skb)->daddr;
1638 if (ulen > skb->len)
1639 goto short_packet;
1641 if (proto == IPPROTO_UDP) {
1642 /* UDP validates ulen. */
1643 if (ulen < sizeof(*uh) || pskb_trim_rcsum(skb, ulen))
1644 goto short_packet;
1645 uh = udp_hdr(skb);
1648 if (udp4_csum_init(skb, uh, proto))
1649 goto csum_error;
1651 if (rt->rt_flags & (RTCF_BROADCAST|RTCF_MULTICAST))
1652 return __udp4_lib_mcast_deliver(net, skb, uh,
1653 saddr, daddr, udptable);
1655 sk = __udp4_lib_lookup_skb(skb, uh->source, uh->dest, udptable);
1657 if (sk != NULL) {
1658 int ret = udp_queue_rcv_skb(sk, skb);
1659 sock_put(sk);
1661 /* a return value > 0 means to resubmit the input, but
1662 * it wants the return to be -protocol, or 0
1664 if (ret > 0)
1665 return -ret;
1666 return 0;
1669 if (!xfrm4_policy_check(NULL, XFRM_POLICY_IN, skb))
1670 goto drop;
1671 nf_reset(skb);
1673 /* No socket. Drop packet silently, if checksum is wrong */
1674 if (udp_lib_checksum_complete(skb))
1675 goto csum_error;
1677 UDP_INC_STATS_BH(net, UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE);
1678 icmp_send(skb, ICMP_DEST_UNREACH, ICMP_PORT_UNREACH, 0);
1681 * Hmm. We got an UDP packet to a port to which we
1682 * don't wanna listen. Ignore it.
1684 kfree_skb(skb);
1685 return 0;
1687 short_packet:
1688 LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: short packet: From %pI4:%u %d/%d to %pI4:%u\n",
1689 proto == IPPROTO_UDPLITE ? "-Lite" : "",
1690 &saddr,
1691 ntohs(uh->source),
1692 ulen,
1693 skb->len,
1694 &daddr,
1695 ntohs(uh->dest));
1696 goto drop;
1698 csum_error:
1700 * RFC1122: OK. Discards the bad packet silently (as far as
1701 * the network is concerned, anyway) as per 4.1.3.4 (MUST).
1703 LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: bad checksum. From %pI4:%u to %pI4:%u ulen %d\n",
1704 proto == IPPROTO_UDPLITE ? "-Lite" : "",
1705 &saddr,
1706 ntohs(uh->source),
1707 &daddr,
1708 ntohs(uh->dest),
1709 ulen);
1710 drop:
1711 UDP_INC_STATS_BH(net, UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE);
1712 kfree_skb(skb);
1713 return 0;
1716 int udp_rcv(struct sk_buff *skb)
1718 return __udp4_lib_rcv(skb, &udp_table, IPPROTO_UDP);
1721 void udp_destroy_sock(struct sock *sk)
1723 bool slow = lock_sock_fast(sk);
1724 udp_flush_pending_frames(sk);
1725 unlock_sock_fast(sk, slow);
1729 * Socket option code for UDP
1731 int udp_lib_setsockopt(struct sock *sk, int level, int optname,
1732 char __user *optval, unsigned int optlen,
1733 int (*push_pending_frames)(struct sock *))
1735 struct udp_sock *up = udp_sk(sk);
1736 int val;
1737 int err = 0;
1738 int is_udplite = IS_UDPLITE(sk);
1740 if (optlen < sizeof(int))
1741 return -EINVAL;
1743 if (get_user(val, (int __user *)optval))
1744 return -EFAULT;
1746 switch (optname) {
1747 case UDP_CORK:
1748 if (val != 0) {
1749 up->corkflag = 1;
1750 } else {
1751 up->corkflag = 0;
1752 lock_sock(sk);
1753 (*push_pending_frames)(sk);
1754 release_sock(sk);
1756 break;
1758 case UDP_ENCAP:
1759 switch (val) {
1760 case 0:
1761 case UDP_ENCAP_ESPINUDP:
1762 case UDP_ENCAP_ESPINUDP_NON_IKE:
1763 up->encap_rcv = xfrm4_udp_encap_rcv;
1764 /* FALLTHROUGH */
1765 case UDP_ENCAP_L2TPINUDP:
1766 up->encap_type = val;
1767 break;
1768 default:
1769 err = -ENOPROTOOPT;
1770 break;
1772 break;
1775 * UDP-Lite's partial checksum coverage (RFC 3828).
1777 /* The sender sets actual checksum coverage length via this option.
1778 * The case coverage > packet length is handled by send module. */
1779 case UDPLITE_SEND_CSCOV:
1780 if (!is_udplite) /* Disable the option on UDP sockets */
1781 return -ENOPROTOOPT;
1782 if (val != 0 && val < 8) /* Illegal coverage: use default (8) */
1783 val = 8;
1784 else if (val > USHRT_MAX)
1785 val = USHRT_MAX;
1786 up->pcslen = val;
1787 up->pcflag |= UDPLITE_SEND_CC;
1788 break;
1790 /* The receiver specifies a minimum checksum coverage value. To make
1791 * sense, this should be set to at least 8 (as done below). If zero is
1792 * used, this again means full checksum coverage. */
1793 case UDPLITE_RECV_CSCOV:
1794 if (!is_udplite) /* Disable the option on UDP sockets */
1795 return -ENOPROTOOPT;
1796 if (val != 0 && val < 8) /* Avoid silly minimal values. */
1797 val = 8;
1798 else if (val > USHRT_MAX)
1799 val = USHRT_MAX;
1800 up->pcrlen = val;
1801 up->pcflag |= UDPLITE_RECV_CC;
1802 break;
1804 default:
1805 err = -ENOPROTOOPT;
1806 break;
1809 return err;
1811 EXPORT_SYMBOL(udp_lib_setsockopt);
1813 int udp_setsockopt(struct sock *sk, int level, int optname,
1814 char __user *optval, unsigned int optlen)
1816 if (level == SOL_UDP || level == SOL_UDPLITE)
1817 return udp_lib_setsockopt(sk, level, optname, optval, optlen,
1818 udp_push_pending_frames);
1819 return ip_setsockopt(sk, level, optname, optval, optlen);
1822 #ifdef CONFIG_COMPAT
1823 int compat_udp_setsockopt(struct sock *sk, int level, int optname,
1824 char __user *optval, unsigned int optlen)
1826 if (level == SOL_UDP || level == SOL_UDPLITE)
1827 return udp_lib_setsockopt(sk, level, optname, optval, optlen,
1828 udp_push_pending_frames);
1829 return compat_ip_setsockopt(sk, level, optname, optval, optlen);
1831 #endif
1833 int udp_lib_getsockopt(struct sock *sk, int level, int optname,
1834 char __user *optval, int __user *optlen)
1836 struct udp_sock *up = udp_sk(sk);
1837 int val, len;
1839 if (get_user(len, optlen))
1840 return -EFAULT;
1842 len = min_t(unsigned int, len, sizeof(int));
1844 if (len < 0)
1845 return -EINVAL;
1847 switch (optname) {
1848 case UDP_CORK:
1849 val = up->corkflag;
1850 break;
1852 case UDP_ENCAP:
1853 val = up->encap_type;
1854 break;
1856 /* The following two cannot be changed on UDP sockets, the return is
1857 * always 0 (which corresponds to the full checksum coverage of UDP). */
1858 case UDPLITE_SEND_CSCOV:
1859 val = up->pcslen;
1860 break;
1862 case UDPLITE_RECV_CSCOV:
1863 val = up->pcrlen;
1864 break;
1866 default:
1867 return -ENOPROTOOPT;
1870 if (put_user(len, optlen))
1871 return -EFAULT;
1872 if (copy_to_user(optval, &val, len))
1873 return -EFAULT;
1874 return 0;
1876 EXPORT_SYMBOL(udp_lib_getsockopt);
1878 int udp_getsockopt(struct sock *sk, int level, int optname,
1879 char __user *optval, int __user *optlen)
1881 if (level == SOL_UDP || level == SOL_UDPLITE)
1882 return udp_lib_getsockopt(sk, level, optname, optval, optlen);
1883 return ip_getsockopt(sk, level, optname, optval, optlen);
1886 #ifdef CONFIG_COMPAT
1887 int compat_udp_getsockopt(struct sock *sk, int level, int optname,
1888 char __user *optval, int __user *optlen)
1890 if (level == SOL_UDP || level == SOL_UDPLITE)
1891 return udp_lib_getsockopt(sk, level, optname, optval, optlen);
1892 return compat_ip_getsockopt(sk, level, optname, optval, optlen);
1894 #endif
1896 * udp_poll - wait for a UDP event.
1897 * @file - file struct
1898 * @sock - socket
1899 * @wait - poll table
1901 * This is same as datagram poll, except for the special case of
1902 * blocking sockets. If application is using a blocking fd
1903 * and a packet with checksum error is in the queue;
1904 * then it could get return from select indicating data available
1905 * but then block when reading it. Add special case code
1906 * to work around these arguably broken applications.
1908 unsigned int udp_poll(struct file *file, struct socket *sock, poll_table *wait)
1910 unsigned int mask = datagram_poll(file, sock, wait);
1911 struct sock *sk = sock->sk;
1913 /* Check for false positives due to checksum errors */
1914 if ((mask & POLLRDNORM) && !(file->f_flags & O_NONBLOCK) &&
1915 !(sk->sk_shutdown & RCV_SHUTDOWN) && !first_packet_length(sk))
1916 mask &= ~(POLLIN | POLLRDNORM);
1918 return mask;
1921 EXPORT_SYMBOL(udp_poll);
1923 struct proto udp_prot = {
1924 .name = "UDP",
1925 .owner = THIS_MODULE,
1926 .close = udp_lib_close,
1927 .connect = ip4_datagram_connect,
1928 .disconnect = udp_disconnect,
1929 .ioctl = udp_ioctl,
1930 .destroy = udp_destroy_sock,
1931 .setsockopt = udp_setsockopt,
1932 .getsockopt = udp_getsockopt,
1933 .sendmsg = udp_sendmsg,
1934 .recvmsg = udp_recvmsg,
1935 .sendpage = udp_sendpage,
1936 .backlog_rcv = __udp_queue_rcv_skb,
1937 .hash = udp_lib_hash,
1938 .unhash = udp_lib_unhash,
1939 .rehash = udp_v4_rehash,
1940 .get_port = udp_v4_get_port,
1941 .memory_allocated = &udp_memory_allocated,
1942 .sysctl_mem = sysctl_udp_mem,
1943 .sysctl_wmem = &sysctl_udp_wmem_min,
1944 .sysctl_rmem = &sysctl_udp_rmem_min,
1945 .obj_size = sizeof(struct udp_sock),
1946 .slab_flags = SLAB_DESTROY_BY_RCU,
1947 .h.udp_table = &udp_table,
1948 #ifdef CONFIG_COMPAT
1949 .compat_setsockopt = compat_udp_setsockopt,
1950 .compat_getsockopt = compat_udp_getsockopt,
1951 #endif
1952 .clear_sk = sk_prot_clear_portaddr_nulls,
1954 EXPORT_SYMBOL(udp_prot);
1956 /* ------------------------------------------------------------------------ */
1957 #ifdef CONFIG_PROC_FS
1959 static struct sock *udp_get_first(struct seq_file *seq, int start)
1961 struct sock *sk;
1962 struct udp_iter_state *state = seq->private;
1963 struct net *net = seq_file_net(seq);
1965 for (state->bucket = start; state->bucket <= state->udp_table->mask;
1966 ++state->bucket) {
1967 struct hlist_nulls_node *node;
1968 struct udp_hslot *hslot = &state->udp_table->hash[state->bucket];
1970 if (hlist_nulls_empty(&hslot->head))
1971 continue;
1973 spin_lock_bh(&hslot->lock);
1974 sk_nulls_for_each(sk, node, &hslot->head) {
1975 if (!net_eq(sock_net(sk), net))
1976 continue;
1977 if (sk->sk_family == state->family)
1978 goto found;
1980 spin_unlock_bh(&hslot->lock);
1982 sk = NULL;
1983 found:
1984 return sk;
1987 static struct sock *udp_get_next(struct seq_file *seq, struct sock *sk)
1989 struct udp_iter_state *state = seq->private;
1990 struct net *net = seq_file_net(seq);
1992 do {
1993 sk = sk_nulls_next(sk);
1994 } while (sk && (!net_eq(sock_net(sk), net) || sk->sk_family != state->family));
1996 if (!sk) {
1997 if (state->bucket <= state->udp_table->mask)
1998 spin_unlock_bh(&state->udp_table->hash[state->bucket].lock);
1999 return udp_get_first(seq, state->bucket + 1);
2001 return sk;
2004 static struct sock *udp_get_idx(struct seq_file *seq, loff_t pos)
2006 struct sock *sk = udp_get_first(seq, 0);
2008 if (sk)
2009 while (pos && (sk = udp_get_next(seq, sk)) != NULL)
2010 --pos;
2011 return pos ? NULL : sk;
2014 static void *udp_seq_start(struct seq_file *seq, loff_t *pos)
2016 struct udp_iter_state *state = seq->private;
2017 state->bucket = MAX_UDP_PORTS;
2019 return *pos ? udp_get_idx(seq, *pos-1) : SEQ_START_TOKEN;
2022 static void *udp_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2024 struct sock *sk;
2026 if (v == SEQ_START_TOKEN)
2027 sk = udp_get_idx(seq, 0);
2028 else
2029 sk = udp_get_next(seq, v);
2031 ++*pos;
2032 return sk;
2035 static void udp_seq_stop(struct seq_file *seq, void *v)
2037 struct udp_iter_state *state = seq->private;
2039 if (state->bucket <= state->udp_table->mask)
2040 spin_unlock_bh(&state->udp_table->hash[state->bucket].lock);
2043 int udp_seq_open(struct inode *inode, struct file *file)
2045 struct udp_seq_afinfo *afinfo = PDE(inode)->data;
2046 struct udp_iter_state *s;
2047 int err;
2049 err = seq_open_net(inode, file, &afinfo->seq_ops,
2050 sizeof(struct udp_iter_state));
2051 if (err < 0)
2052 return err;
2054 s = ((struct seq_file *)file->private_data)->private;
2055 s->family = afinfo->family;
2056 s->udp_table = afinfo->udp_table;
2057 return err;
2059 EXPORT_SYMBOL(udp_seq_open);
2061 /* ------------------------------------------------------------------------ */
2062 int udp_proc_register(struct net *net, struct udp_seq_afinfo *afinfo)
2064 struct proc_dir_entry *p;
2065 int rc = 0;
2067 afinfo->seq_ops.start = udp_seq_start;
2068 afinfo->seq_ops.next = udp_seq_next;
2069 afinfo->seq_ops.stop = udp_seq_stop;
2071 p = proc_create_data(afinfo->name, S_IRUGO, net->proc_net,
2072 afinfo->seq_fops, afinfo);
2073 if (!p)
2074 rc = -ENOMEM;
2075 return rc;
2077 EXPORT_SYMBOL(udp_proc_register);
2079 void udp_proc_unregister(struct net *net, struct udp_seq_afinfo *afinfo)
2081 proc_net_remove(net, afinfo->name);
2083 EXPORT_SYMBOL(udp_proc_unregister);
2085 /* ------------------------------------------------------------------------ */
2086 static void udp4_format_sock(struct sock *sp, struct seq_file *f,
2087 int bucket, int *len)
2089 struct inet_sock *inet = inet_sk(sp);
2090 __be32 dest = inet->inet_daddr;
2091 __be32 src = inet->inet_rcv_saddr;
2092 __u16 destp = ntohs(inet->inet_dport);
2093 __u16 srcp = ntohs(inet->inet_sport);
2095 seq_printf(f, "%5d: %08X:%04X %08X:%04X"
2096 " %02X %08X:%08X %02X:%08lX %08X %5d %8d %lu %d %pK %d%n",
2097 bucket, src, srcp, dest, destp, sp->sk_state,
2098 sk_wmem_alloc_get(sp),
2099 sk_rmem_alloc_get(sp),
2100 0, 0L, 0, sock_i_uid(sp), 0, sock_i_ino(sp),
2101 atomic_read(&sp->sk_refcnt), sp,
2102 atomic_read(&sp->sk_drops), len);
2105 int udp4_seq_show(struct seq_file *seq, void *v)
2107 if (v == SEQ_START_TOKEN)
2108 seq_printf(seq, "%-127s\n",
2109 " sl local_address rem_address st tx_queue "
2110 "rx_queue tr tm->when retrnsmt uid timeout "
2111 "inode ref pointer drops");
2112 else {
2113 struct udp_iter_state *state = seq->private;
2114 int len;
2116 udp4_format_sock(v, seq, state->bucket, &len);
2117 seq_printf(seq, "%*s\n", 127 - len, "");
2119 return 0;
2122 static const struct file_operations udp_afinfo_seq_fops = {
2123 .owner = THIS_MODULE,
2124 .open = udp_seq_open,
2125 .read = seq_read,
2126 .llseek = seq_lseek,
2127 .release = seq_release_net
2130 /* ------------------------------------------------------------------------ */
2131 static struct udp_seq_afinfo udp4_seq_afinfo = {
2132 .name = "udp",
2133 .family = AF_INET,
2134 .udp_table = &udp_table,
2135 .seq_fops = &udp_afinfo_seq_fops,
2136 .seq_ops = {
2137 .show = udp4_seq_show,
2141 static int __net_init udp4_proc_init_net(struct net *net)
2143 return udp_proc_register(net, &udp4_seq_afinfo);
2146 static void __net_exit udp4_proc_exit_net(struct net *net)
2148 udp_proc_unregister(net, &udp4_seq_afinfo);
2151 static struct pernet_operations udp4_net_ops = {
2152 .init = udp4_proc_init_net,
2153 .exit = udp4_proc_exit_net,
2156 int __init udp4_proc_init(void)
2158 return register_pernet_subsys(&udp4_net_ops);
2161 void udp4_proc_exit(void)
2163 unregister_pernet_subsys(&udp4_net_ops);
2165 #endif /* CONFIG_PROC_FS */
2167 static __initdata unsigned long uhash_entries;
2168 static int __init set_uhash_entries(char *str)
2170 if (!str)
2171 return 0;
2172 uhash_entries = simple_strtoul(str, &str, 0);
2173 if (uhash_entries && uhash_entries < UDP_HTABLE_SIZE_MIN)
2174 uhash_entries = UDP_HTABLE_SIZE_MIN;
2175 return 1;
2177 __setup("uhash_entries=", set_uhash_entries);
2179 void __init udp_table_init(struct udp_table *table, const char *name)
2181 unsigned int i;
2183 if (!CONFIG_BASE_SMALL)
2184 table->hash = alloc_large_system_hash(name,
2185 2 * sizeof(struct udp_hslot),
2186 uhash_entries,
2187 21, /* one slot per 2 MB */
2189 &table->log,
2190 &table->mask,
2191 64 * 1024);
2193 * Make sure hash table has the minimum size
2195 if (CONFIG_BASE_SMALL || table->mask < UDP_HTABLE_SIZE_MIN - 1) {
2196 table->hash = kmalloc(UDP_HTABLE_SIZE_MIN *
2197 2 * sizeof(struct udp_hslot), GFP_KERNEL);
2198 if (!table->hash)
2199 panic(name);
2200 table->log = ilog2(UDP_HTABLE_SIZE_MIN);
2201 table->mask = UDP_HTABLE_SIZE_MIN - 1;
2203 table->hash2 = table->hash + (table->mask + 1);
2204 for (i = 0; i <= table->mask; i++) {
2205 INIT_HLIST_NULLS_HEAD(&table->hash[i].head, i);
2206 table->hash[i].count = 0;
2207 spin_lock_init(&table->hash[i].lock);
2209 for (i = 0; i <= table->mask; i++) {
2210 INIT_HLIST_NULLS_HEAD(&table->hash2[i].head, i);
2211 table->hash2[i].count = 0;
2212 spin_lock_init(&table->hash2[i].lock);
2216 void __init udp_init(void)
2218 unsigned long limit;
2220 udp_table_init(&udp_table, "UDP");
2221 limit = nr_free_buffer_pages() / 8;
2222 limit = max(limit, 128UL);
2223 sysctl_udp_mem[0] = limit / 4 * 3;
2224 sysctl_udp_mem[1] = limit;
2225 sysctl_udp_mem[2] = sysctl_udp_mem[0] * 2;
2227 sysctl_udp_rmem_min = SK_MEM_QUANTUM;
2228 sysctl_udp_wmem_min = SK_MEM_QUANTUM;
2231 int udp4_ufo_send_check(struct sk_buff *skb)
2233 const struct iphdr *iph;
2234 struct udphdr *uh;
2236 if (!pskb_may_pull(skb, sizeof(*uh)))
2237 return -EINVAL;
2239 iph = ip_hdr(skb);
2240 uh = udp_hdr(skb);
2242 uh->check = ~csum_tcpudp_magic(iph->saddr, iph->daddr, skb->len,
2243 IPPROTO_UDP, 0);
2244 skb->csum_start = skb_transport_header(skb) - skb->head;
2245 skb->csum_offset = offsetof(struct udphdr, check);
2246 skb->ip_summed = CHECKSUM_PARTIAL;
2247 return 0;
2250 struct sk_buff *udp4_ufo_fragment(struct sk_buff *skb, u32 features)
2252 struct sk_buff *segs = ERR_PTR(-EINVAL);
2253 unsigned int mss;
2254 int offset;
2255 __wsum csum;
2257 mss = skb_shinfo(skb)->gso_size;
2258 if (unlikely(skb->len <= mss))
2259 goto out;
2261 if (skb_gso_ok(skb, features | NETIF_F_GSO_ROBUST)) {
2262 /* Packet is from an untrusted source, reset gso_segs. */
2263 int type = skb_shinfo(skb)->gso_type;
2265 if (unlikely(type & ~(SKB_GSO_UDP | SKB_GSO_DODGY) ||
2266 !(type & (SKB_GSO_UDP))))
2267 goto out;
2269 skb_shinfo(skb)->gso_segs = DIV_ROUND_UP(skb->len, mss);
2271 segs = NULL;
2272 goto out;
2275 /* Do software UFO. Complete and fill in the UDP checksum as HW cannot
2276 * do checksum of UDP packets sent as multiple IP fragments.
2278 offset = skb_checksum_start_offset(skb);
2279 csum = skb_checksum(skb, offset, skb->len - offset, 0);
2280 offset += skb->csum_offset;
2281 *(__sum16 *)(skb->data + offset) = csum_fold(csum);
2282 skb->ip_summed = CHECKSUM_NONE;
2284 /* Fragment the skb. IP headers of the fragments are updated in
2285 * inet_gso_segment()
2287 segs = skb_segment(skb, features);
2288 out:
2289 return segs;