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).
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>
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
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
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
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 #define pr_fmt(fmt) "UDP: " fmt
82 #include <asm/uaccess.h>
83 #include <asm/ioctls.h>
84 #include <linux/bootmem.h>
85 #include <linux/highmem.h>
86 #include <linux/swap.h>
87 #include <linux/types.h>
88 #include <linux/fcntl.h>
89 #include <linux/module.h>
90 #include <linux/socket.h>
91 #include <linux/sockios.h>
92 #include <linux/igmp.h>
93 #include <linux/inetdevice.h>
95 #include <linux/errno.h>
96 #include <linux/timer.h>
98 #include <linux/inet.h>
99 #include <linux/netdevice.h>
100 #include <linux/slab.h>
101 #include <net/tcp_states.h>
102 #include <linux/skbuff.h>
103 #include <linux/proc_fs.h>
104 #include <linux/seq_file.h>
105 #include <net/net_namespace.h>
106 #include <net/icmp.h>
107 #include <net/inet_hashtables.h>
108 #include <net/route.h>
109 #include <net/checksum.h>
110 #include <net/xfrm.h>
111 #include <trace/events/udp.h>
112 #include <linux/static_key.h>
113 #include <trace/events/skb.h>
114 #include <net/busy_poll.h>
115 #include "udp_impl.h"
117 struct udp_table udp_table __read_mostly
;
118 EXPORT_SYMBOL(udp_table
);
120 long sysctl_udp_mem
[3] __read_mostly
;
121 EXPORT_SYMBOL(sysctl_udp_mem
);
123 int sysctl_udp_rmem_min __read_mostly
;
124 EXPORT_SYMBOL(sysctl_udp_rmem_min
);
126 int sysctl_udp_wmem_min __read_mostly
;
127 EXPORT_SYMBOL(sysctl_udp_wmem_min
);
129 atomic_long_t udp_memory_allocated
;
130 EXPORT_SYMBOL(udp_memory_allocated
);
132 #define MAX_UDP_PORTS 65536
133 #define PORTS_PER_CHAIN (MAX_UDP_PORTS / UDP_HTABLE_SIZE_MIN)
135 static int udp_lib_lport_inuse(struct net
*net
, __u16 num
,
136 const struct udp_hslot
*hslot
,
137 unsigned long *bitmap
,
139 int (*saddr_comp
)(const struct sock
*sk1
,
140 const struct sock
*sk2
),
144 struct hlist_nulls_node
*node
;
145 kuid_t uid
= sock_i_uid(sk
);
147 sk_nulls_for_each(sk2
, node
, &hslot
->head
) {
148 if (net_eq(sock_net(sk2
), net
) &&
150 (bitmap
|| udp_sk(sk2
)->udp_port_hash
== num
) &&
151 (!sk2
->sk_reuse
|| !sk
->sk_reuse
) &&
152 (!sk2
->sk_bound_dev_if
|| !sk
->sk_bound_dev_if
||
153 sk2
->sk_bound_dev_if
== sk
->sk_bound_dev_if
) &&
154 (!sk2
->sk_reuseport
|| !sk
->sk_reuseport
||
155 !uid_eq(uid
, sock_i_uid(sk2
))) &&
156 saddr_comp(sk
, sk2
)) {
159 __set_bit(udp_sk(sk2
)->udp_port_hash
>> log
, bitmap
);
166 * Note: we still hold spinlock of primary hash chain, so no other writer
167 * can insert/delete a socket with local_port == num
169 static int udp_lib_lport_inuse2(struct net
*net
, __u16 num
,
170 struct udp_hslot
*hslot2
,
172 int (*saddr_comp
)(const struct sock
*sk1
,
173 const struct sock
*sk2
))
176 struct hlist_nulls_node
*node
;
177 kuid_t uid
= sock_i_uid(sk
);
180 spin_lock(&hslot2
->lock
);
181 udp_portaddr_for_each_entry(sk2
, node
, &hslot2
->head
) {
182 if (net_eq(sock_net(sk2
), net
) &&
184 (udp_sk(sk2
)->udp_port_hash
== num
) &&
185 (!sk2
->sk_reuse
|| !sk
->sk_reuse
) &&
186 (!sk2
->sk_bound_dev_if
|| !sk
->sk_bound_dev_if
||
187 sk2
->sk_bound_dev_if
== sk
->sk_bound_dev_if
) &&
188 (!sk2
->sk_reuseport
|| !sk
->sk_reuseport
||
189 !uid_eq(uid
, sock_i_uid(sk2
))) &&
190 saddr_comp(sk
, sk2
)) {
195 spin_unlock(&hslot2
->lock
);
200 * udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
202 * @sk: socket struct in question
203 * @snum: port number to look up
204 * @saddr_comp: AF-dependent comparison of bound local IP addresses
205 * @hash2_nulladdr: AF-dependent hash value in secondary hash chains,
208 int udp_lib_get_port(struct sock
*sk
, unsigned short snum
,
209 int (*saddr_comp
)(const struct sock
*sk1
,
210 const struct sock
*sk2
),
211 unsigned int hash2_nulladdr
)
213 struct udp_hslot
*hslot
, *hslot2
;
214 struct udp_table
*udptable
= sk
->sk_prot
->h
.udp_table
;
216 struct net
*net
= sock_net(sk
);
219 int low
, high
, remaining
;
221 unsigned short first
, last
;
222 DECLARE_BITMAP(bitmap
, PORTS_PER_CHAIN
);
224 inet_get_local_port_range(net
, &low
, &high
);
225 remaining
= (high
- low
) + 1;
227 rand
= prandom_u32();
228 first
= reciprocal_scale(rand
, remaining
) + low
;
230 * force rand to be an odd multiple of UDP_HTABLE_SIZE
232 rand
= (rand
| 1) * (udptable
->mask
+ 1);
233 last
= first
+ udptable
->mask
+ 1;
235 hslot
= udp_hashslot(udptable
, net
, first
);
236 bitmap_zero(bitmap
, PORTS_PER_CHAIN
);
237 spin_lock_bh(&hslot
->lock
);
238 udp_lib_lport_inuse(net
, snum
, hslot
, bitmap
, sk
,
239 saddr_comp
, udptable
->log
);
243 * Iterate on all possible values of snum for this hash.
244 * Using steps of an odd multiple of UDP_HTABLE_SIZE
245 * give us randomization and full range coverage.
248 if (low
<= snum
&& snum
<= high
&&
249 !test_bit(snum
>> udptable
->log
, bitmap
) &&
250 !inet_is_local_reserved_port(net
, snum
))
253 } while (snum
!= first
);
254 spin_unlock_bh(&hslot
->lock
);
255 } while (++first
!= last
);
258 hslot
= udp_hashslot(udptable
, net
, snum
);
259 spin_lock_bh(&hslot
->lock
);
260 if (hslot
->count
> 10) {
262 unsigned int slot2
= udp_sk(sk
)->udp_portaddr_hash
^ snum
;
264 slot2
&= udptable
->mask
;
265 hash2_nulladdr
&= udptable
->mask
;
267 hslot2
= udp_hashslot2(udptable
, slot2
);
268 if (hslot
->count
< hslot2
->count
)
269 goto scan_primary_hash
;
271 exist
= udp_lib_lport_inuse2(net
, snum
, hslot2
,
273 if (!exist
&& (hash2_nulladdr
!= slot2
)) {
274 hslot2
= udp_hashslot2(udptable
, hash2_nulladdr
);
275 exist
= udp_lib_lport_inuse2(net
, snum
, hslot2
,
284 if (udp_lib_lport_inuse(net
, snum
, hslot
, NULL
, sk
,
289 inet_sk(sk
)->inet_num
= snum
;
290 udp_sk(sk
)->udp_port_hash
= snum
;
291 udp_sk(sk
)->udp_portaddr_hash
^= snum
;
292 if (sk_unhashed(sk
)) {
293 sk_nulls_add_node_rcu(sk
, &hslot
->head
);
295 sock_prot_inuse_add(sock_net(sk
), sk
->sk_prot
, 1);
297 hslot2
= udp_hashslot2(udptable
, udp_sk(sk
)->udp_portaddr_hash
);
298 spin_lock(&hslot2
->lock
);
299 hlist_nulls_add_head_rcu(&udp_sk(sk
)->udp_portaddr_node
,
302 spin_unlock(&hslot2
->lock
);
306 spin_unlock_bh(&hslot
->lock
);
310 EXPORT_SYMBOL(udp_lib_get_port
);
312 static int ipv4_rcv_saddr_equal(const struct sock
*sk1
, const struct sock
*sk2
)
314 struct inet_sock
*inet1
= inet_sk(sk1
), *inet2
= inet_sk(sk2
);
316 return (!ipv6_only_sock(sk2
) &&
317 (!inet1
->inet_rcv_saddr
|| !inet2
->inet_rcv_saddr
||
318 inet1
->inet_rcv_saddr
== inet2
->inet_rcv_saddr
));
321 static u32
udp4_portaddr_hash(const struct net
*net
, __be32 saddr
,
324 return jhash_1word((__force u32
)saddr
, net_hash_mix(net
)) ^ port
;
327 int udp_v4_get_port(struct sock
*sk
, unsigned short snum
)
329 unsigned int hash2_nulladdr
=
330 udp4_portaddr_hash(sock_net(sk
), htonl(INADDR_ANY
), snum
);
331 unsigned int hash2_partial
=
332 udp4_portaddr_hash(sock_net(sk
), inet_sk(sk
)->inet_rcv_saddr
, 0);
334 /* precompute partial secondary hash */
335 udp_sk(sk
)->udp_portaddr_hash
= hash2_partial
;
336 return udp_lib_get_port(sk
, snum
, ipv4_rcv_saddr_equal
, hash2_nulladdr
);
339 static inline int compute_score(struct sock
*sk
, struct net
*net
,
340 __be32 saddr
, unsigned short hnum
, __be16 sport
,
341 __be32 daddr
, __be16 dport
, int dif
)
344 struct inet_sock
*inet
;
346 if (!net_eq(sock_net(sk
), net
) ||
347 udp_sk(sk
)->udp_port_hash
!= hnum
||
351 score
= (sk
->sk_family
== PF_INET
) ? 2 : 1;
354 if (inet
->inet_rcv_saddr
) {
355 if (inet
->inet_rcv_saddr
!= daddr
)
360 if (inet
->inet_daddr
) {
361 if (inet
->inet_daddr
!= saddr
)
366 if (inet
->inet_dport
) {
367 if (inet
->inet_dport
!= sport
)
372 if (sk
->sk_bound_dev_if
) {
373 if (sk
->sk_bound_dev_if
!= dif
)
377 if (sk
->sk_incoming_cpu
== raw_smp_processor_id())
383 * In this second variant, we check (daddr, dport) matches (inet_rcv_sadd, inet_num)
385 static inline int compute_score2(struct sock
*sk
, struct net
*net
,
386 __be32 saddr
, __be16 sport
,
387 __be32 daddr
, unsigned int hnum
, int dif
)
390 struct inet_sock
*inet
;
392 if (!net_eq(sock_net(sk
), net
) ||
398 if (inet
->inet_rcv_saddr
!= daddr
||
399 inet
->inet_num
!= hnum
)
402 score
= (sk
->sk_family
== PF_INET
) ? 2 : 1;
404 if (inet
->inet_daddr
) {
405 if (inet
->inet_daddr
!= saddr
)
410 if (inet
->inet_dport
) {
411 if (inet
->inet_dport
!= sport
)
416 if (sk
->sk_bound_dev_if
) {
417 if (sk
->sk_bound_dev_if
!= dif
)
422 if (sk
->sk_incoming_cpu
== raw_smp_processor_id())
428 static u32
udp_ehashfn(const struct net
*net
, const __be32 laddr
,
429 const __u16 lport
, const __be32 faddr
,
432 static u32 udp_ehash_secret __read_mostly
;
434 net_get_random_once(&udp_ehash_secret
, sizeof(udp_ehash_secret
));
436 return __inet_ehashfn(laddr
, lport
, faddr
, fport
,
437 udp_ehash_secret
+ net_hash_mix(net
));
440 /* called with read_rcu_lock() */
441 static struct sock
*udp4_lib_lookup2(struct net
*net
,
442 __be32 saddr
, __be16 sport
,
443 __be32 daddr
, unsigned int hnum
, int dif
,
444 struct udp_hslot
*hslot2
, unsigned int slot2
)
446 struct sock
*sk
, *result
;
447 struct hlist_nulls_node
*node
;
448 int score
, badness
, matches
= 0, reuseport
= 0;
454 udp_portaddr_for_each_entry_rcu(sk
, node
, &hslot2
->head
) {
455 score
= compute_score2(sk
, net
, saddr
, sport
,
457 if (score
> badness
) {
460 reuseport
= sk
->sk_reuseport
;
462 hash
= udp_ehashfn(net
, daddr
, hnum
,
466 } else if (score
== badness
&& reuseport
) {
468 if (reciprocal_scale(hash
, matches
) == 0)
470 hash
= next_pseudo_random32(hash
);
474 * if the nulls value we got at the end of this lookup is
475 * not the expected one, we must restart lookup.
476 * We probably met an item that was moved to another chain.
478 if (get_nulls_value(node
) != slot2
)
481 if (unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
483 else if (unlikely(compute_score2(result
, net
, saddr
, sport
,
484 daddr
, hnum
, dif
) < badness
)) {
492 /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
493 * harder than this. -DaveM
495 struct sock
*__udp4_lib_lookup(struct net
*net
, __be32 saddr
,
496 __be16 sport
, __be32 daddr
, __be16 dport
,
497 int dif
, struct udp_table
*udptable
)
499 struct sock
*sk
, *result
;
500 struct hlist_nulls_node
*node
;
501 unsigned short hnum
= ntohs(dport
);
502 unsigned int hash2
, slot2
, slot
= udp_hashfn(net
, hnum
, udptable
->mask
);
503 struct udp_hslot
*hslot2
, *hslot
= &udptable
->hash
[slot
];
504 int score
, badness
, matches
= 0, reuseport
= 0;
508 if (hslot
->count
> 10) {
509 hash2
= udp4_portaddr_hash(net
, daddr
, hnum
);
510 slot2
= hash2
& udptable
->mask
;
511 hslot2
= &udptable
->hash2
[slot2
];
512 if (hslot
->count
< hslot2
->count
)
515 result
= udp4_lib_lookup2(net
, saddr
, sport
,
519 hash2
= udp4_portaddr_hash(net
, htonl(INADDR_ANY
), hnum
);
520 slot2
= hash2
& udptable
->mask
;
521 hslot2
= &udptable
->hash2
[slot2
];
522 if (hslot
->count
< hslot2
->count
)
525 result
= udp4_lib_lookup2(net
, saddr
, sport
,
526 htonl(INADDR_ANY
), hnum
, dif
,
535 sk_nulls_for_each_rcu(sk
, node
, &hslot
->head
) {
536 score
= compute_score(sk
, net
, saddr
, hnum
, sport
,
538 if (score
> badness
) {
541 reuseport
= sk
->sk_reuseport
;
543 hash
= udp_ehashfn(net
, daddr
, hnum
,
547 } else if (score
== badness
&& reuseport
) {
549 if (reciprocal_scale(hash
, matches
) == 0)
551 hash
= next_pseudo_random32(hash
);
555 * if the nulls value we got at the end of this lookup is
556 * not the expected one, we must restart lookup.
557 * We probably met an item that was moved to another chain.
559 if (get_nulls_value(node
) != slot
)
563 if (unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
565 else if (unlikely(compute_score(result
, net
, saddr
, hnum
, sport
,
566 daddr
, dport
, dif
) < badness
)) {
574 EXPORT_SYMBOL_GPL(__udp4_lib_lookup
);
576 static inline struct sock
*__udp4_lib_lookup_skb(struct sk_buff
*skb
,
577 __be16 sport
, __be16 dport
,
578 struct udp_table
*udptable
)
580 const struct iphdr
*iph
= ip_hdr(skb
);
582 return __udp4_lib_lookup(dev_net(skb_dst(skb
)->dev
), iph
->saddr
, sport
,
583 iph
->daddr
, dport
, inet_iif(skb
),
587 struct sock
*udp4_lib_lookup(struct net
*net
, __be32 saddr
, __be16 sport
,
588 __be32 daddr
, __be16 dport
, int dif
)
590 return __udp4_lib_lookup(net
, saddr
, sport
, daddr
, dport
, dif
, &udp_table
);
592 EXPORT_SYMBOL_GPL(udp4_lib_lookup
);
594 static inline bool __udp_is_mcast_sock(struct net
*net
, struct sock
*sk
,
595 __be16 loc_port
, __be32 loc_addr
,
596 __be16 rmt_port
, __be32 rmt_addr
,
597 int dif
, unsigned short hnum
)
599 struct inet_sock
*inet
= inet_sk(sk
);
601 if (!net_eq(sock_net(sk
), net
) ||
602 udp_sk(sk
)->udp_port_hash
!= hnum
||
603 (inet
->inet_daddr
&& inet
->inet_daddr
!= rmt_addr
) ||
604 (inet
->inet_dport
!= rmt_port
&& inet
->inet_dport
) ||
605 (inet
->inet_rcv_saddr
&& inet
->inet_rcv_saddr
!= loc_addr
) ||
606 ipv6_only_sock(sk
) ||
607 (sk
->sk_bound_dev_if
&& sk
->sk_bound_dev_if
!= dif
))
609 if (!ip_mc_sf_allow(sk
, loc_addr
, rmt_addr
, dif
))
615 * This routine is called by the ICMP module when it gets some
616 * sort of error condition. If err < 0 then the socket should
617 * be closed and the error returned to the user. If err > 0
618 * it's just the icmp type << 8 | icmp code.
619 * Header points to the ip header of the error packet. We move
620 * on past this. Then (as it used to claim before adjustment)
621 * header points to the first 8 bytes of the udp header. We need
622 * to find the appropriate port.
625 void __udp4_lib_err(struct sk_buff
*skb
, u32 info
, struct udp_table
*udptable
)
627 struct inet_sock
*inet
;
628 const struct iphdr
*iph
= (const struct iphdr
*)skb
->data
;
629 struct udphdr
*uh
= (struct udphdr
*)(skb
->data
+(iph
->ihl
<<2));
630 const int type
= icmp_hdr(skb
)->type
;
631 const int code
= icmp_hdr(skb
)->code
;
635 struct net
*net
= dev_net(skb
->dev
);
637 sk
= __udp4_lib_lookup(net
, iph
->daddr
, uh
->dest
,
638 iph
->saddr
, uh
->source
, skb
->dev
->ifindex
, udptable
);
640 ICMP_INC_STATS_BH(net
, ICMP_MIB_INERRORS
);
641 return; /* No socket for error */
650 case ICMP_TIME_EXCEEDED
:
653 case ICMP_SOURCE_QUENCH
:
655 case ICMP_PARAMETERPROB
:
659 case ICMP_DEST_UNREACH
:
660 if (code
== ICMP_FRAG_NEEDED
) { /* Path MTU discovery */
661 ipv4_sk_update_pmtu(skb
, sk
, info
);
662 if (inet
->pmtudisc
!= IP_PMTUDISC_DONT
) {
670 if (code
<= NR_ICMP_UNREACH
) {
671 harderr
= icmp_err_convert
[code
].fatal
;
672 err
= icmp_err_convert
[code
].errno
;
676 ipv4_sk_redirect(skb
, sk
);
681 * RFC1122: OK. Passes ICMP errors back to application, as per
684 if (!inet
->recverr
) {
685 if (!harderr
|| sk
->sk_state
!= TCP_ESTABLISHED
)
688 ip_icmp_error(sk
, skb
, err
, uh
->dest
, info
, (u8
*)(uh
+1));
691 sk
->sk_error_report(sk
);
696 void udp_err(struct sk_buff
*skb
, u32 info
)
698 __udp4_lib_err(skb
, info
, &udp_table
);
702 * Throw away all pending data and cancel the corking. Socket is locked.
704 void udp_flush_pending_frames(struct sock
*sk
)
706 struct udp_sock
*up
= udp_sk(sk
);
711 ip_flush_pending_frames(sk
);
714 EXPORT_SYMBOL(udp_flush_pending_frames
);
717 * udp4_hwcsum - handle outgoing HW checksumming
718 * @skb: sk_buff containing the filled-in UDP header
719 * (checksum field must be zeroed out)
720 * @src: source IP address
721 * @dst: destination IP address
723 void udp4_hwcsum(struct sk_buff
*skb
, __be32 src
, __be32 dst
)
725 struct udphdr
*uh
= udp_hdr(skb
);
726 int offset
= skb_transport_offset(skb
);
727 int len
= skb
->len
- offset
;
731 if (!skb_has_frag_list(skb
)) {
733 * Only one fragment on the socket.
735 skb
->csum_start
= skb_transport_header(skb
) - skb
->head
;
736 skb
->csum_offset
= offsetof(struct udphdr
, check
);
737 uh
->check
= ~csum_tcpudp_magic(src
, dst
, len
,
740 struct sk_buff
*frags
;
743 * HW-checksum won't work as there are two or more
744 * fragments on the socket so that all csums of sk_buffs
747 skb_walk_frags(skb
, frags
) {
748 csum
= csum_add(csum
, frags
->csum
);
752 csum
= skb_checksum(skb
, offset
, hlen
, csum
);
753 skb
->ip_summed
= CHECKSUM_NONE
;
755 uh
->check
= csum_tcpudp_magic(src
, dst
, len
, IPPROTO_UDP
, csum
);
757 uh
->check
= CSUM_MANGLED_0
;
760 EXPORT_SYMBOL_GPL(udp4_hwcsum
);
762 /* Function to set UDP checksum for an IPv4 UDP packet. This is intended
763 * for the simple case like when setting the checksum for a UDP tunnel.
765 void udp_set_csum(bool nocheck
, struct sk_buff
*skb
,
766 __be32 saddr
, __be32 daddr
, int len
)
768 struct udphdr
*uh
= udp_hdr(skb
);
772 else if (skb_is_gso(skb
))
773 uh
->check
= ~udp_v4_check(len
, saddr
, daddr
, 0);
774 else if (skb_dst(skb
) && skb_dst(skb
)->dev
&&
775 (skb_dst(skb
)->dev
->features
& NETIF_F_V4_CSUM
)) {
777 BUG_ON(skb
->ip_summed
== CHECKSUM_PARTIAL
);
779 skb
->ip_summed
= CHECKSUM_PARTIAL
;
780 skb
->csum_start
= skb_transport_header(skb
) - skb
->head
;
781 skb
->csum_offset
= offsetof(struct udphdr
, check
);
782 uh
->check
= ~udp_v4_check(len
, saddr
, daddr
, 0);
786 BUG_ON(skb
->ip_summed
== CHECKSUM_PARTIAL
);
789 csum
= skb_checksum(skb
, 0, len
, 0);
790 uh
->check
= udp_v4_check(len
, saddr
, daddr
, csum
);
792 uh
->check
= CSUM_MANGLED_0
;
794 skb
->ip_summed
= CHECKSUM_UNNECESSARY
;
797 EXPORT_SYMBOL(udp_set_csum
);
799 static int udp_send_skb(struct sk_buff
*skb
, struct flowi4
*fl4
)
801 struct sock
*sk
= skb
->sk
;
802 struct inet_sock
*inet
= inet_sk(sk
);
805 int is_udplite
= IS_UDPLITE(sk
);
806 int offset
= skb_transport_offset(skb
);
807 int len
= skb
->len
- offset
;
811 * Create a UDP header
814 uh
->source
= inet
->inet_sport
;
815 uh
->dest
= fl4
->fl4_dport
;
816 uh
->len
= htons(len
);
819 if (is_udplite
) /* UDP-Lite */
820 csum
= udplite_csum(skb
);
822 else if (sk
->sk_no_check_tx
) { /* UDP csum disabled */
824 skb
->ip_summed
= CHECKSUM_NONE
;
827 } else if (skb
->ip_summed
== CHECKSUM_PARTIAL
) { /* UDP hardware csum */
829 udp4_hwcsum(skb
, fl4
->saddr
, fl4
->daddr
);
833 csum
= udp_csum(skb
);
835 /* add protocol-dependent pseudo-header */
836 uh
->check
= csum_tcpudp_magic(fl4
->saddr
, fl4
->daddr
, len
,
837 sk
->sk_protocol
, csum
);
839 uh
->check
= CSUM_MANGLED_0
;
842 err
= ip_send_skb(sock_net(sk
), skb
);
844 if (err
== -ENOBUFS
&& !inet
->recverr
) {
845 UDP_INC_STATS_USER(sock_net(sk
),
846 UDP_MIB_SNDBUFERRORS
, is_udplite
);
850 UDP_INC_STATS_USER(sock_net(sk
),
851 UDP_MIB_OUTDATAGRAMS
, is_udplite
);
856 * Push out all pending data as one UDP datagram. Socket is locked.
858 int udp_push_pending_frames(struct sock
*sk
)
860 struct udp_sock
*up
= udp_sk(sk
);
861 struct inet_sock
*inet
= inet_sk(sk
);
862 struct flowi4
*fl4
= &inet
->cork
.fl
.u
.ip4
;
866 skb
= ip_finish_skb(sk
, fl4
);
870 err
= udp_send_skb(skb
, fl4
);
877 EXPORT_SYMBOL(udp_push_pending_frames
);
879 int udp_sendmsg(struct sock
*sk
, struct msghdr
*msg
, size_t len
)
881 struct inet_sock
*inet
= inet_sk(sk
);
882 struct udp_sock
*up
= udp_sk(sk
);
883 struct flowi4 fl4_stack
;
886 struct ipcm_cookie ipc
;
887 struct rtable
*rt
= NULL
;
890 __be32 daddr
, faddr
, saddr
;
893 int err
, is_udplite
= IS_UDPLITE(sk
);
894 int corkreq
= up
->corkflag
|| msg
->msg_flags
&MSG_MORE
;
895 int (*getfrag
)(void *, char *, int, int, int, struct sk_buff
*);
897 struct ip_options_data opt_copy
;
906 if (msg
->msg_flags
& MSG_OOB
) /* Mirror BSD error message compatibility */
914 getfrag
= is_udplite
? udplite_getfrag
: ip_generic_getfrag
;
916 fl4
= &inet
->cork
.fl
.u
.ip4
;
919 * There are pending frames.
920 * The socket lock must be held while it's corked.
923 if (likely(up
->pending
)) {
924 if (unlikely(up
->pending
!= AF_INET
)) {
932 ulen
+= sizeof(struct udphdr
);
935 * Get and verify the address.
938 DECLARE_SOCKADDR(struct sockaddr_in
*, usin
, msg
->msg_name
);
939 if (msg
->msg_namelen
< sizeof(*usin
))
941 if (usin
->sin_family
!= AF_INET
) {
942 if (usin
->sin_family
!= AF_UNSPEC
)
943 return -EAFNOSUPPORT
;
946 daddr
= usin
->sin_addr
.s_addr
;
947 dport
= usin
->sin_port
;
951 if (sk
->sk_state
!= TCP_ESTABLISHED
)
952 return -EDESTADDRREQ
;
953 daddr
= inet
->inet_daddr
;
954 dport
= inet
->inet_dport
;
955 /* Open fast path for connected socket.
956 Route will not be used, if at least one option is set.
960 ipc
.addr
= inet
->inet_saddr
;
962 ipc
.oif
= sk
->sk_bound_dev_if
;
964 sock_tx_timestamp(sk
, &ipc
.tx_flags
);
966 if (msg
->msg_controllen
) {
967 err
= ip_cmsg_send(sock_net(sk
), msg
, &ipc
,
968 sk
->sk_family
== AF_INET6
);
976 struct ip_options_rcu
*inet_opt
;
979 inet_opt
= rcu_dereference(inet
->inet_opt
);
981 memcpy(&opt_copy
, inet_opt
,
982 sizeof(*inet_opt
) + inet_opt
->opt
.optlen
);
983 ipc
.opt
= &opt_copy
.opt
;
989 ipc
.addr
= faddr
= daddr
;
991 if (ipc
.opt
&& ipc
.opt
->opt
.srr
) {
994 faddr
= ipc
.opt
->opt
.faddr
;
997 tos
= get_rttos(&ipc
, inet
);
998 if (sock_flag(sk
, SOCK_LOCALROUTE
) ||
999 (msg
->msg_flags
& MSG_DONTROUTE
) ||
1000 (ipc
.opt
&& ipc
.opt
->opt
.is_strictroute
)) {
1005 if (ipv4_is_multicast(daddr
)) {
1007 ipc
.oif
= inet
->mc_index
;
1009 saddr
= inet
->mc_addr
;
1011 } else if (!ipc
.oif
)
1012 ipc
.oif
= inet
->uc_index
;
1015 rt
= (struct rtable
*)sk_dst_check(sk
, 0);
1018 struct net
*net
= sock_net(sk
);
1019 __u8 flow_flags
= inet_sk_flowi_flags(sk
);
1023 flowi4_init_output(fl4
, ipc
.oif
, sk
->sk_mark
, tos
,
1024 RT_SCOPE_UNIVERSE
, sk
->sk_protocol
,
1026 faddr
, saddr
, dport
, inet
->inet_sport
);
1028 if (!saddr
&& ipc
.oif
) {
1029 err
= l3mdev_get_saddr(net
, ipc
.oif
, fl4
);
1034 security_sk_classify_flow(sk
, flowi4_to_flowi(fl4
));
1035 rt
= ip_route_output_flow(net
, fl4
, sk
);
1039 if (err
== -ENETUNREACH
)
1040 IP_INC_STATS(net
, IPSTATS_MIB_OUTNOROUTES
);
1045 if ((rt
->rt_flags
& RTCF_BROADCAST
) &&
1046 !sock_flag(sk
, SOCK_BROADCAST
))
1049 sk_dst_set(sk
, dst_clone(&rt
->dst
));
1052 if (msg
->msg_flags
&MSG_CONFIRM
)
1058 daddr
= ipc
.addr
= fl4
->daddr
;
1060 /* Lockless fast path for the non-corking case. */
1062 skb
= ip_make_skb(sk
, fl4
, getfrag
, msg
, ulen
,
1063 sizeof(struct udphdr
), &ipc
, &rt
,
1066 if (!IS_ERR_OR_NULL(skb
))
1067 err
= udp_send_skb(skb
, fl4
);
1072 if (unlikely(up
->pending
)) {
1073 /* The socket is already corked while preparing it. */
1074 /* ... which is an evident application bug. --ANK */
1077 net_dbg_ratelimited("cork app bug 2\n");
1082 * Now cork the socket to pend data.
1084 fl4
= &inet
->cork
.fl
.u
.ip4
;
1087 fl4
->fl4_dport
= dport
;
1088 fl4
->fl4_sport
= inet
->inet_sport
;
1089 up
->pending
= AF_INET
;
1093 err
= ip_append_data(sk
, fl4
, getfrag
, msg
, ulen
,
1094 sizeof(struct udphdr
), &ipc
, &rt
,
1095 corkreq
? msg
->msg_flags
|MSG_MORE
: msg
->msg_flags
);
1097 udp_flush_pending_frames(sk
);
1099 err
= udp_push_pending_frames(sk
);
1100 else if (unlikely(skb_queue_empty(&sk
->sk_write_queue
)))
1111 * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
1112 * ENOBUFS might not be good (it's not tunable per se), but otherwise
1113 * we don't have a good statistic (IpOutDiscards but it can be too many
1114 * things). We could add another new stat but at least for now that
1115 * seems like overkill.
1117 if (err
== -ENOBUFS
|| test_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
)) {
1118 UDP_INC_STATS_USER(sock_net(sk
),
1119 UDP_MIB_SNDBUFERRORS
, is_udplite
);
1124 dst_confirm(&rt
->dst
);
1125 if (!(msg
->msg_flags
&MSG_PROBE
) || len
)
1126 goto back_from_confirm
;
1130 EXPORT_SYMBOL(udp_sendmsg
);
1132 int udp_sendpage(struct sock
*sk
, struct page
*page
, int offset
,
1133 size_t size
, int flags
)
1135 struct inet_sock
*inet
= inet_sk(sk
);
1136 struct udp_sock
*up
= udp_sk(sk
);
1139 if (flags
& MSG_SENDPAGE_NOTLAST
)
1143 struct msghdr msg
= { .msg_flags
= flags
|MSG_MORE
};
1145 /* Call udp_sendmsg to specify destination address which
1146 * sendpage interface can't pass.
1147 * This will succeed only when the socket is connected.
1149 ret
= udp_sendmsg(sk
, &msg
, 0);
1156 if (unlikely(!up
->pending
)) {
1159 net_dbg_ratelimited("udp cork app bug 3\n");
1163 ret
= ip_append_page(sk
, &inet
->cork
.fl
.u
.ip4
,
1164 page
, offset
, size
, flags
);
1165 if (ret
== -EOPNOTSUPP
) {
1167 return sock_no_sendpage(sk
->sk_socket
, page
, offset
,
1171 udp_flush_pending_frames(sk
);
1176 if (!(up
->corkflag
|| (flags
&MSG_MORE
)))
1177 ret
= udp_push_pending_frames(sk
);
1186 * first_packet_length - return length of first packet in receive queue
1189 * Drops all bad checksum frames, until a valid one is found.
1190 * Returns the length of found skb, or 0 if none is found.
1192 static unsigned int first_packet_length(struct sock
*sk
)
1194 struct sk_buff_head list_kill
, *rcvq
= &sk
->sk_receive_queue
;
1195 struct sk_buff
*skb
;
1198 __skb_queue_head_init(&list_kill
);
1200 spin_lock_bh(&rcvq
->lock
);
1201 while ((skb
= skb_peek(rcvq
)) != NULL
&&
1202 udp_lib_checksum_complete(skb
)) {
1203 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_CSUMERRORS
,
1205 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
,
1207 atomic_inc(&sk
->sk_drops
);
1208 __skb_unlink(skb
, rcvq
);
1209 __skb_queue_tail(&list_kill
, skb
);
1211 res
= skb
? skb
->len
: 0;
1212 spin_unlock_bh(&rcvq
->lock
);
1214 if (!skb_queue_empty(&list_kill
)) {
1215 bool slow
= lock_sock_fast(sk
);
1217 __skb_queue_purge(&list_kill
);
1218 sk_mem_reclaim_partial(sk
);
1219 unlock_sock_fast(sk
, slow
);
1225 * IOCTL requests applicable to the UDP protocol
1228 int udp_ioctl(struct sock
*sk
, int cmd
, unsigned long arg
)
1233 int amount
= sk_wmem_alloc_get(sk
);
1235 return put_user(amount
, (int __user
*)arg
);
1240 unsigned int amount
= first_packet_length(sk
);
1244 * We will only return the amount
1245 * of this packet since that is all
1246 * that will be read.
1248 amount
-= sizeof(struct udphdr
);
1250 return put_user(amount
, (int __user
*)arg
);
1254 return -ENOIOCTLCMD
;
1259 EXPORT_SYMBOL(udp_ioctl
);
1262 * This should be easy, if there is something there we
1263 * return it, otherwise we block.
1266 int udp_recvmsg(struct sock
*sk
, struct msghdr
*msg
, size_t len
, int noblock
,
1267 int flags
, int *addr_len
)
1269 struct inet_sock
*inet
= inet_sk(sk
);
1270 DECLARE_SOCKADDR(struct sockaddr_in
*, sin
, msg
->msg_name
);
1271 struct sk_buff
*skb
;
1272 unsigned int ulen
, copied
;
1273 int peeked
, off
= 0;
1275 int is_udplite
= IS_UDPLITE(sk
);
1278 if (flags
& MSG_ERRQUEUE
)
1279 return ip_recv_error(sk
, msg
, len
, addr_len
);
1282 skb
= __skb_recv_datagram(sk
, flags
| (noblock
? MSG_DONTWAIT
: 0),
1283 &peeked
, &off
, &err
);
1287 ulen
= skb
->len
- sizeof(struct udphdr
);
1291 else if (copied
< ulen
)
1292 msg
->msg_flags
|= MSG_TRUNC
;
1295 * If checksum is needed at all, try to do it while copying the
1296 * data. If the data is truncated, or if we only want a partial
1297 * coverage checksum (UDP-Lite), do it before the copy.
1300 if (copied
< ulen
|| UDP_SKB_CB(skb
)->partial_cov
) {
1301 if (udp_lib_checksum_complete(skb
))
1305 if (skb_csum_unnecessary(skb
))
1306 err
= skb_copy_datagram_msg(skb
, sizeof(struct udphdr
),
1309 err
= skb_copy_and_csum_datagram_msg(skb
, sizeof(struct udphdr
),
1316 if (unlikely(err
)) {
1317 trace_kfree_skb(skb
, udp_recvmsg
);
1319 atomic_inc(&sk
->sk_drops
);
1320 UDP_INC_STATS_USER(sock_net(sk
),
1321 UDP_MIB_INERRORS
, is_udplite
);
1327 UDP_INC_STATS_USER(sock_net(sk
),
1328 UDP_MIB_INDATAGRAMS
, is_udplite
);
1330 sock_recv_ts_and_drops(msg
, sk
, skb
);
1332 /* Copy the address. */
1334 sin
->sin_family
= AF_INET
;
1335 sin
->sin_port
= udp_hdr(skb
)->source
;
1336 sin
->sin_addr
.s_addr
= ip_hdr(skb
)->saddr
;
1337 memset(sin
->sin_zero
, 0, sizeof(sin
->sin_zero
));
1338 *addr_len
= sizeof(*sin
);
1340 if (inet
->cmsg_flags
)
1341 ip_cmsg_recv_offset(msg
, skb
, sizeof(struct udphdr
));
1344 if (flags
& MSG_TRUNC
)
1348 skb_free_datagram_locked(sk
, skb
);
1353 slow
= lock_sock_fast(sk
);
1354 if (!skb_kill_datagram(sk
, skb
, flags
)) {
1355 UDP_INC_STATS_USER(sock_net(sk
), UDP_MIB_CSUMERRORS
, is_udplite
);
1356 UDP_INC_STATS_USER(sock_net(sk
), UDP_MIB_INERRORS
, is_udplite
);
1358 unlock_sock_fast(sk
, slow
);
1360 /* starting over for a new packet, but check if we need to yield */
1362 msg
->msg_flags
&= ~MSG_TRUNC
;
1366 int udp_disconnect(struct sock
*sk
, int flags
)
1368 struct inet_sock
*inet
= inet_sk(sk
);
1370 * 1003.1g - break association.
1373 sk
->sk_state
= TCP_CLOSE
;
1374 inet
->inet_daddr
= 0;
1375 inet
->inet_dport
= 0;
1376 sock_rps_reset_rxhash(sk
);
1377 sk
->sk_bound_dev_if
= 0;
1378 if (!(sk
->sk_userlocks
& SOCK_BINDADDR_LOCK
))
1379 inet_reset_saddr(sk
);
1381 if (!(sk
->sk_userlocks
& SOCK_BINDPORT_LOCK
)) {
1382 sk
->sk_prot
->unhash(sk
);
1383 inet
->inet_sport
= 0;
1388 EXPORT_SYMBOL(udp_disconnect
);
1390 void udp_lib_unhash(struct sock
*sk
)
1392 if (sk_hashed(sk
)) {
1393 struct udp_table
*udptable
= sk
->sk_prot
->h
.udp_table
;
1394 struct udp_hslot
*hslot
, *hslot2
;
1396 hslot
= udp_hashslot(udptable
, sock_net(sk
),
1397 udp_sk(sk
)->udp_port_hash
);
1398 hslot2
= udp_hashslot2(udptable
, udp_sk(sk
)->udp_portaddr_hash
);
1400 spin_lock_bh(&hslot
->lock
);
1401 if (sk_nulls_del_node_init_rcu(sk
)) {
1403 inet_sk(sk
)->inet_num
= 0;
1404 sock_prot_inuse_add(sock_net(sk
), sk
->sk_prot
, -1);
1406 spin_lock(&hslot2
->lock
);
1407 hlist_nulls_del_init_rcu(&udp_sk(sk
)->udp_portaddr_node
);
1409 spin_unlock(&hslot2
->lock
);
1411 spin_unlock_bh(&hslot
->lock
);
1414 EXPORT_SYMBOL(udp_lib_unhash
);
1417 * inet_rcv_saddr was changed, we must rehash secondary hash
1419 void udp_lib_rehash(struct sock
*sk
, u16 newhash
)
1421 if (sk_hashed(sk
)) {
1422 struct udp_table
*udptable
= sk
->sk_prot
->h
.udp_table
;
1423 struct udp_hslot
*hslot
, *hslot2
, *nhslot2
;
1425 hslot2
= udp_hashslot2(udptable
, udp_sk(sk
)->udp_portaddr_hash
);
1426 nhslot2
= udp_hashslot2(udptable
, newhash
);
1427 udp_sk(sk
)->udp_portaddr_hash
= newhash
;
1428 if (hslot2
!= nhslot2
) {
1429 hslot
= udp_hashslot(udptable
, sock_net(sk
),
1430 udp_sk(sk
)->udp_port_hash
);
1431 /* we must lock primary chain too */
1432 spin_lock_bh(&hslot
->lock
);
1434 spin_lock(&hslot2
->lock
);
1435 hlist_nulls_del_init_rcu(&udp_sk(sk
)->udp_portaddr_node
);
1437 spin_unlock(&hslot2
->lock
);
1439 spin_lock(&nhslot2
->lock
);
1440 hlist_nulls_add_head_rcu(&udp_sk(sk
)->udp_portaddr_node
,
1443 spin_unlock(&nhslot2
->lock
);
1445 spin_unlock_bh(&hslot
->lock
);
1449 EXPORT_SYMBOL(udp_lib_rehash
);
1451 static void udp_v4_rehash(struct sock
*sk
)
1453 u16 new_hash
= udp4_portaddr_hash(sock_net(sk
),
1454 inet_sk(sk
)->inet_rcv_saddr
,
1455 inet_sk(sk
)->inet_num
);
1456 udp_lib_rehash(sk
, new_hash
);
1459 static int __udp_queue_rcv_skb(struct sock
*sk
, struct sk_buff
*skb
)
1463 if (inet_sk(sk
)->inet_daddr
) {
1464 sock_rps_save_rxhash(sk
, skb
);
1465 sk_mark_napi_id(sk
, skb
);
1466 sk_incoming_cpu_update(sk
);
1469 rc
= sock_queue_rcv_skb(sk
, skb
);
1471 int is_udplite
= IS_UDPLITE(sk
);
1473 /* Note that an ENOMEM error is charged twice */
1475 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_RCVBUFERRORS
,
1477 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
, is_udplite
);
1479 trace_udp_fail_queue_rcv_skb(rc
, sk
);
1487 static struct static_key udp_encap_needed __read_mostly
;
1488 void udp_encap_enable(void)
1490 if (!static_key_enabled(&udp_encap_needed
))
1491 static_key_slow_inc(&udp_encap_needed
);
1493 EXPORT_SYMBOL(udp_encap_enable
);
1498 * >0: "udp encap" protocol resubmission
1500 * Note that in the success and error cases, the skb is assumed to
1501 * have either been requeued or freed.
1503 int udp_queue_rcv_skb(struct sock
*sk
, struct sk_buff
*skb
)
1505 struct udp_sock
*up
= udp_sk(sk
);
1507 int is_udplite
= IS_UDPLITE(sk
);
1510 * Charge it to the socket, dropping if the queue is full.
1512 if (!xfrm4_policy_check(sk
, XFRM_POLICY_IN
, skb
))
1516 if (static_key_false(&udp_encap_needed
) && up
->encap_type
) {
1517 int (*encap_rcv
)(struct sock
*sk
, struct sk_buff
*skb
);
1520 * This is an encapsulation socket so pass the skb to
1521 * the socket's udp_encap_rcv() hook. Otherwise, just
1522 * fall through and pass this up the UDP socket.
1523 * up->encap_rcv() returns the following value:
1524 * =0 if skb was successfully passed to the encap
1525 * handler or was discarded by it.
1526 * >0 if skb should be passed on to UDP.
1527 * <0 if skb should be resubmitted as proto -N
1530 /* if we're overly short, let UDP handle it */
1531 encap_rcv
= ACCESS_ONCE(up
->encap_rcv
);
1532 if (skb
->len
> sizeof(struct udphdr
) && encap_rcv
) {
1535 /* Verify checksum before giving to encap */
1536 if (udp_lib_checksum_complete(skb
))
1539 ret
= encap_rcv(sk
, skb
);
1541 UDP_INC_STATS_BH(sock_net(sk
),
1542 UDP_MIB_INDATAGRAMS
,
1548 /* FALLTHROUGH -- it's a UDP Packet */
1552 * UDP-Lite specific tests, ignored on UDP sockets
1554 if ((is_udplite
& UDPLITE_RECV_CC
) && UDP_SKB_CB(skb
)->partial_cov
) {
1557 * MIB statistics other than incrementing the error count are
1558 * disabled for the following two types of errors: these depend
1559 * on the application settings, not on the functioning of the
1560 * protocol stack as such.
1562 * RFC 3828 here recommends (sec 3.3): "There should also be a
1563 * way ... to ... at least let the receiving application block
1564 * delivery of packets with coverage values less than a value
1565 * provided by the application."
1567 if (up
->pcrlen
== 0) { /* full coverage was set */
1568 net_dbg_ratelimited("UDPLite: partial coverage %d while full coverage %d requested\n",
1569 UDP_SKB_CB(skb
)->cscov
, skb
->len
);
1572 /* The next case involves violating the min. coverage requested
1573 * by the receiver. This is subtle: if receiver wants x and x is
1574 * greater than the buffersize/MTU then receiver will complain
1575 * that it wants x while sender emits packets of smaller size y.
1576 * Therefore the above ...()->partial_cov statement is essential.
1578 if (UDP_SKB_CB(skb
)->cscov
< up
->pcrlen
) {
1579 net_dbg_ratelimited("UDPLite: coverage %d too small, need min %d\n",
1580 UDP_SKB_CB(skb
)->cscov
, up
->pcrlen
);
1585 if (rcu_access_pointer(sk
->sk_filter
) &&
1586 udp_lib_checksum_complete(skb
))
1589 if (sk_rcvqueues_full(sk
, sk
->sk_rcvbuf
)) {
1590 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_RCVBUFERRORS
,
1597 ipv4_pktinfo_prepare(sk
, skb
);
1599 if (!sock_owned_by_user(sk
))
1600 rc
= __udp_queue_rcv_skb(sk
, skb
);
1601 else if (sk_add_backlog(sk
, skb
, sk
->sk_rcvbuf
)) {
1610 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_CSUMERRORS
, is_udplite
);
1612 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
, is_udplite
);
1613 atomic_inc(&sk
->sk_drops
);
1618 static void flush_stack(struct sock
**stack
, unsigned int count
,
1619 struct sk_buff
*skb
, unsigned int final
)
1622 struct sk_buff
*skb1
= NULL
;
1625 for (i
= 0; i
< count
; i
++) {
1628 skb1
= (i
== final
) ? skb
: skb_clone(skb
, GFP_ATOMIC
);
1631 atomic_inc(&sk
->sk_drops
);
1632 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_RCVBUFERRORS
,
1634 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
,
1638 if (skb1
&& udp_queue_rcv_skb(sk
, skb1
) <= 0)
1647 /* For TCP sockets, sk_rx_dst is protected by socket lock
1648 * For UDP, we use xchg() to guard against concurrent changes.
1650 static void udp_sk_rx_dst_set(struct sock
*sk
, struct dst_entry
*dst
)
1652 struct dst_entry
*old
;
1655 old
= xchg(&sk
->sk_rx_dst
, dst
);
1660 * Multicasts and broadcasts go to each listener.
1662 * Note: called only from the BH handler context.
1664 static int __udp4_lib_mcast_deliver(struct net
*net
, struct sk_buff
*skb
,
1666 __be32 saddr
, __be32 daddr
,
1667 struct udp_table
*udptable
,
1670 struct sock
*sk
, *stack
[256 / sizeof(struct sock
*)];
1671 struct hlist_nulls_node
*node
;
1672 unsigned short hnum
= ntohs(uh
->dest
);
1673 struct udp_hslot
*hslot
= udp_hashslot(udptable
, net
, hnum
);
1674 int dif
= skb
->dev
->ifindex
;
1675 unsigned int count
= 0, offset
= offsetof(typeof(*sk
), sk_nulls_node
);
1676 unsigned int hash2
= 0, hash2_any
= 0, use_hash2
= (hslot
->count
> 10);
1677 bool inner_flushed
= false;
1680 hash2_any
= udp4_portaddr_hash(net
, htonl(INADDR_ANY
), hnum
) &
1682 hash2
= udp4_portaddr_hash(net
, daddr
, hnum
) & udp_table
.mask
;
1684 hslot
= &udp_table
.hash2
[hash2
];
1685 offset
= offsetof(typeof(*sk
), __sk_common
.skc_portaddr_node
);
1688 spin_lock(&hslot
->lock
);
1689 sk_nulls_for_each_entry_offset(sk
, node
, &hslot
->head
, offset
) {
1690 if (__udp_is_mcast_sock(net
, sk
,
1694 if (unlikely(count
== ARRAY_SIZE(stack
))) {
1695 flush_stack(stack
, count
, skb
, ~0);
1696 inner_flushed
= true;
1699 stack
[count
++] = sk
;
1704 spin_unlock(&hslot
->lock
);
1706 /* Also lookup *:port if we are using hash2 and haven't done so yet. */
1707 if (use_hash2
&& hash2
!= hash2_any
) {
1713 * do the slow work with no lock held
1716 flush_stack(stack
, count
, skb
, count
- 1);
1719 UDP_INC_STATS_BH(net
, UDP_MIB_IGNOREDMULTI
,
1720 proto
== IPPROTO_UDPLITE
);
1726 /* Initialize UDP checksum. If exited with zero value (success),
1727 * CHECKSUM_UNNECESSARY means, that no more checks are required.
1728 * Otherwise, csum completion requires chacksumming packet body,
1729 * including udp header and folding it to skb->csum.
1731 static inline int udp4_csum_init(struct sk_buff
*skb
, struct udphdr
*uh
,
1736 UDP_SKB_CB(skb
)->partial_cov
= 0;
1737 UDP_SKB_CB(skb
)->cscov
= skb
->len
;
1739 if (proto
== IPPROTO_UDPLITE
) {
1740 err
= udplite_checksum_init(skb
, uh
);
1745 return skb_checksum_init_zero_check(skb
, proto
, uh
->check
,
1746 inet_compute_pseudo
);
1750 * All we need to do is get the socket, and then do a checksum.
1753 int __udp4_lib_rcv(struct sk_buff
*skb
, struct udp_table
*udptable
,
1758 unsigned short ulen
;
1759 struct rtable
*rt
= skb_rtable(skb
);
1760 __be32 saddr
, daddr
;
1761 struct net
*net
= dev_net(skb
->dev
);
1764 * Validate the packet.
1766 if (!pskb_may_pull(skb
, sizeof(struct udphdr
)))
1767 goto drop
; /* No space for header. */
1770 ulen
= ntohs(uh
->len
);
1771 saddr
= ip_hdr(skb
)->saddr
;
1772 daddr
= ip_hdr(skb
)->daddr
;
1774 if (ulen
> skb
->len
)
1777 if (proto
== IPPROTO_UDP
) {
1778 /* UDP validates ulen. */
1779 if (ulen
< sizeof(*uh
) || pskb_trim_rcsum(skb
, ulen
))
1784 if (udp4_csum_init(skb
, uh
, proto
))
1787 sk
= skb_steal_sock(skb
);
1789 struct dst_entry
*dst
= skb_dst(skb
);
1792 if (unlikely(sk
->sk_rx_dst
!= dst
))
1793 udp_sk_rx_dst_set(sk
, dst
);
1795 ret
= udp_queue_rcv_skb(sk
, skb
);
1797 /* a return value > 0 means to resubmit the input, but
1798 * it wants the return to be -protocol, or 0
1805 if (rt
->rt_flags
& (RTCF_BROADCAST
|RTCF_MULTICAST
))
1806 return __udp4_lib_mcast_deliver(net
, skb
, uh
,
1807 saddr
, daddr
, udptable
, proto
);
1809 sk
= __udp4_lib_lookup_skb(skb
, uh
->source
, uh
->dest
, udptable
);
1813 if (inet_get_convert_csum(sk
) && uh
->check
&& !IS_UDPLITE(sk
))
1814 skb_checksum_try_convert(skb
, IPPROTO_UDP
, uh
->check
,
1815 inet_compute_pseudo
);
1817 ret
= udp_queue_rcv_skb(sk
, skb
);
1820 /* a return value > 0 means to resubmit the input, but
1821 * it wants the return to be -protocol, or 0
1828 if (!xfrm4_policy_check(NULL
, XFRM_POLICY_IN
, skb
))
1832 /* No socket. Drop packet silently, if checksum is wrong */
1833 if (udp_lib_checksum_complete(skb
))
1836 UDP_INC_STATS_BH(net
, UDP_MIB_NOPORTS
, proto
== IPPROTO_UDPLITE
);
1837 icmp_send(skb
, ICMP_DEST_UNREACH
, ICMP_PORT_UNREACH
, 0);
1840 * Hmm. We got an UDP packet to a port to which we
1841 * don't wanna listen. Ignore it.
1847 net_dbg_ratelimited("UDP%s: short packet: From %pI4:%u %d/%d to %pI4:%u\n",
1848 proto
== IPPROTO_UDPLITE
? "Lite" : "",
1849 &saddr
, ntohs(uh
->source
),
1851 &daddr
, ntohs(uh
->dest
));
1856 * RFC1122: OK. Discards the bad packet silently (as far as
1857 * the network is concerned, anyway) as per 4.1.3.4 (MUST).
1859 net_dbg_ratelimited("UDP%s: bad checksum. From %pI4:%u to %pI4:%u ulen %d\n",
1860 proto
== IPPROTO_UDPLITE
? "Lite" : "",
1861 &saddr
, ntohs(uh
->source
), &daddr
, ntohs(uh
->dest
),
1863 UDP_INC_STATS_BH(net
, UDP_MIB_CSUMERRORS
, proto
== IPPROTO_UDPLITE
);
1865 UDP_INC_STATS_BH(net
, UDP_MIB_INERRORS
, proto
== IPPROTO_UDPLITE
);
1870 /* We can only early demux multicast if there is a single matching socket.
1871 * If more than one socket found returns NULL
1873 static struct sock
*__udp4_lib_mcast_demux_lookup(struct net
*net
,
1874 __be16 loc_port
, __be32 loc_addr
,
1875 __be16 rmt_port
, __be32 rmt_addr
,
1878 struct sock
*sk
, *result
;
1879 struct hlist_nulls_node
*node
;
1880 unsigned short hnum
= ntohs(loc_port
);
1881 unsigned int count
, slot
= udp_hashfn(net
, hnum
, udp_table
.mask
);
1882 struct udp_hslot
*hslot
= &udp_table
.hash
[slot
];
1884 /* Do not bother scanning a too big list */
1885 if (hslot
->count
> 10)
1892 sk_nulls_for_each_rcu(sk
, node
, &hslot
->head
) {
1893 if (__udp_is_mcast_sock(net
, sk
,
1902 * if the nulls value we got at the end of this lookup is
1903 * not the expected one, we must restart lookup.
1904 * We probably met an item that was moved to another chain.
1906 if (get_nulls_value(node
) != slot
)
1911 unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
1913 else if (unlikely(!__udp_is_mcast_sock(net
, result
,
1925 /* For unicast we should only early demux connected sockets or we can
1926 * break forwarding setups. The chains here can be long so only check
1927 * if the first socket is an exact match and if not move on.
1929 static struct sock
*__udp4_lib_demux_lookup(struct net
*net
,
1930 __be16 loc_port
, __be32 loc_addr
,
1931 __be16 rmt_port
, __be32 rmt_addr
,
1934 struct sock
*sk
, *result
;
1935 struct hlist_nulls_node
*node
;
1936 unsigned short hnum
= ntohs(loc_port
);
1937 unsigned int hash2
= udp4_portaddr_hash(net
, loc_addr
, hnum
);
1938 unsigned int slot2
= hash2
& udp_table
.mask
;
1939 struct udp_hslot
*hslot2
= &udp_table
.hash2
[slot2
];
1940 INET_ADDR_COOKIE(acookie
, rmt_addr
, loc_addr
);
1941 const __portpair ports
= INET_COMBINED_PORTS(rmt_port
, hnum
);
1945 udp_portaddr_for_each_entry_rcu(sk
, node
, &hslot2
->head
) {
1946 if (INET_MATCH(sk
, net
, acookie
,
1947 rmt_addr
, loc_addr
, ports
, dif
))
1949 /* Only check first socket in chain */
1954 if (unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
1956 else if (unlikely(!INET_MATCH(sk
, net
, acookie
,
1967 void udp_v4_early_demux(struct sk_buff
*skb
)
1969 struct net
*net
= dev_net(skb
->dev
);
1970 const struct iphdr
*iph
;
1971 const struct udphdr
*uh
;
1973 struct dst_entry
*dst
;
1974 int dif
= skb
->dev
->ifindex
;
1977 /* validate the packet */
1978 if (!pskb_may_pull(skb
, skb_transport_offset(skb
) + sizeof(struct udphdr
)))
1984 if (skb
->pkt_type
== PACKET_BROADCAST
||
1985 skb
->pkt_type
== PACKET_MULTICAST
) {
1986 struct in_device
*in_dev
= __in_dev_get_rcu(skb
->dev
);
1991 ours
= ip_check_mc_rcu(in_dev
, iph
->daddr
, iph
->saddr
,
1995 sk
= __udp4_lib_mcast_demux_lookup(net
, uh
->dest
, iph
->daddr
,
1996 uh
->source
, iph
->saddr
, dif
);
1997 } else if (skb
->pkt_type
== PACKET_HOST
) {
1998 sk
= __udp4_lib_demux_lookup(net
, uh
->dest
, iph
->daddr
,
1999 uh
->source
, iph
->saddr
, dif
);
2008 skb
->destructor
= sock_efree
;
2009 dst
= READ_ONCE(sk
->sk_rx_dst
);
2012 dst
= dst_check(dst
, 0);
2014 /* DST_NOCACHE can not be used without taking a reference */
2015 if (dst
->flags
& DST_NOCACHE
) {
2016 if (likely(atomic_inc_not_zero(&dst
->__refcnt
)))
2017 skb_dst_set(skb
, dst
);
2019 skb_dst_set_noref(skb
, dst
);
2024 int udp_rcv(struct sk_buff
*skb
)
2026 return __udp4_lib_rcv(skb
, &udp_table
, IPPROTO_UDP
);
2029 void udp_destroy_sock(struct sock
*sk
)
2031 struct udp_sock
*up
= udp_sk(sk
);
2032 bool slow
= lock_sock_fast(sk
);
2033 udp_flush_pending_frames(sk
);
2034 unlock_sock_fast(sk
, slow
);
2035 if (static_key_false(&udp_encap_needed
) && up
->encap_type
) {
2036 void (*encap_destroy
)(struct sock
*sk
);
2037 encap_destroy
= ACCESS_ONCE(up
->encap_destroy
);
2044 * Socket option code for UDP
2046 int udp_lib_setsockopt(struct sock
*sk
, int level
, int optname
,
2047 char __user
*optval
, unsigned int optlen
,
2048 int (*push_pending_frames
)(struct sock
*))
2050 struct udp_sock
*up
= udp_sk(sk
);
2053 int is_udplite
= IS_UDPLITE(sk
);
2055 if (optlen
< sizeof(int))
2058 if (get_user(val
, (int __user
*)optval
))
2061 valbool
= val
? 1 : 0;
2070 push_pending_frames(sk
);
2078 case UDP_ENCAP_ESPINUDP
:
2079 case UDP_ENCAP_ESPINUDP_NON_IKE
:
2080 up
->encap_rcv
= xfrm4_udp_encap_rcv
;
2082 case UDP_ENCAP_L2TPINUDP
:
2083 up
->encap_type
= val
;
2092 case UDP_NO_CHECK6_TX
:
2093 up
->no_check6_tx
= valbool
;
2096 case UDP_NO_CHECK6_RX
:
2097 up
->no_check6_rx
= valbool
;
2101 * UDP-Lite's partial checksum coverage (RFC 3828).
2103 /* The sender sets actual checksum coverage length via this option.
2104 * The case coverage > packet length is handled by send module. */
2105 case UDPLITE_SEND_CSCOV
:
2106 if (!is_udplite
) /* Disable the option on UDP sockets */
2107 return -ENOPROTOOPT
;
2108 if (val
!= 0 && val
< 8) /* Illegal coverage: use default (8) */
2110 else if (val
> USHRT_MAX
)
2113 up
->pcflag
|= UDPLITE_SEND_CC
;
2116 /* The receiver specifies a minimum checksum coverage value. To make
2117 * sense, this should be set to at least 8 (as done below). If zero is
2118 * used, this again means full checksum coverage. */
2119 case UDPLITE_RECV_CSCOV
:
2120 if (!is_udplite
) /* Disable the option on UDP sockets */
2121 return -ENOPROTOOPT
;
2122 if (val
!= 0 && val
< 8) /* Avoid silly minimal values. */
2124 else if (val
> USHRT_MAX
)
2127 up
->pcflag
|= UDPLITE_RECV_CC
;
2137 EXPORT_SYMBOL(udp_lib_setsockopt
);
2139 int udp_setsockopt(struct sock
*sk
, int level
, int optname
,
2140 char __user
*optval
, unsigned int optlen
)
2142 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2143 return udp_lib_setsockopt(sk
, level
, optname
, optval
, optlen
,
2144 udp_push_pending_frames
);
2145 return ip_setsockopt(sk
, level
, optname
, optval
, optlen
);
2148 #ifdef CONFIG_COMPAT
2149 int compat_udp_setsockopt(struct sock
*sk
, int level
, int optname
,
2150 char __user
*optval
, unsigned int optlen
)
2152 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2153 return udp_lib_setsockopt(sk
, level
, optname
, optval
, optlen
,
2154 udp_push_pending_frames
);
2155 return compat_ip_setsockopt(sk
, level
, optname
, optval
, optlen
);
2159 int udp_lib_getsockopt(struct sock
*sk
, int level
, int optname
,
2160 char __user
*optval
, int __user
*optlen
)
2162 struct udp_sock
*up
= udp_sk(sk
);
2165 if (get_user(len
, optlen
))
2168 len
= min_t(unsigned int, len
, sizeof(int));
2179 val
= up
->encap_type
;
2182 case UDP_NO_CHECK6_TX
:
2183 val
= up
->no_check6_tx
;
2186 case UDP_NO_CHECK6_RX
:
2187 val
= up
->no_check6_rx
;
2190 /* The following two cannot be changed on UDP sockets, the return is
2191 * always 0 (which corresponds to the full checksum coverage of UDP). */
2192 case UDPLITE_SEND_CSCOV
:
2196 case UDPLITE_RECV_CSCOV
:
2201 return -ENOPROTOOPT
;
2204 if (put_user(len
, optlen
))
2206 if (copy_to_user(optval
, &val
, len
))
2210 EXPORT_SYMBOL(udp_lib_getsockopt
);
2212 int udp_getsockopt(struct sock
*sk
, int level
, int optname
,
2213 char __user
*optval
, int __user
*optlen
)
2215 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2216 return udp_lib_getsockopt(sk
, level
, optname
, optval
, optlen
);
2217 return ip_getsockopt(sk
, level
, optname
, optval
, optlen
);
2220 #ifdef CONFIG_COMPAT
2221 int compat_udp_getsockopt(struct sock
*sk
, int level
, int optname
,
2222 char __user
*optval
, int __user
*optlen
)
2224 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2225 return udp_lib_getsockopt(sk
, level
, optname
, optval
, optlen
);
2226 return compat_ip_getsockopt(sk
, level
, optname
, optval
, optlen
);
2230 * udp_poll - wait for a UDP event.
2231 * @file - file struct
2233 * @wait - poll table
2235 * This is same as datagram poll, except for the special case of
2236 * blocking sockets. If application is using a blocking fd
2237 * and a packet with checksum error is in the queue;
2238 * then it could get return from select indicating data available
2239 * but then block when reading it. Add special case code
2240 * to work around these arguably broken applications.
2242 unsigned int udp_poll(struct file
*file
, struct socket
*sock
, poll_table
*wait
)
2244 unsigned int mask
= datagram_poll(file
, sock
, wait
);
2245 struct sock
*sk
= sock
->sk
;
2247 sock_rps_record_flow(sk
);
2249 /* Check for false positives due to checksum errors */
2250 if ((mask
& POLLRDNORM
) && !(file
->f_flags
& O_NONBLOCK
) &&
2251 !(sk
->sk_shutdown
& RCV_SHUTDOWN
) && !first_packet_length(sk
))
2252 mask
&= ~(POLLIN
| POLLRDNORM
);
2257 EXPORT_SYMBOL(udp_poll
);
2259 struct proto udp_prot
= {
2261 .owner
= THIS_MODULE
,
2262 .close
= udp_lib_close
,
2263 .connect
= ip4_datagram_connect
,
2264 .disconnect
= udp_disconnect
,
2266 .destroy
= udp_destroy_sock
,
2267 .setsockopt
= udp_setsockopt
,
2268 .getsockopt
= udp_getsockopt
,
2269 .sendmsg
= udp_sendmsg
,
2270 .recvmsg
= udp_recvmsg
,
2271 .sendpage
= udp_sendpage
,
2272 .backlog_rcv
= __udp_queue_rcv_skb
,
2273 .release_cb
= ip4_datagram_release_cb
,
2274 .hash
= udp_lib_hash
,
2275 .unhash
= udp_lib_unhash
,
2276 .rehash
= udp_v4_rehash
,
2277 .get_port
= udp_v4_get_port
,
2278 .memory_allocated
= &udp_memory_allocated
,
2279 .sysctl_mem
= sysctl_udp_mem
,
2280 .sysctl_wmem
= &sysctl_udp_wmem_min
,
2281 .sysctl_rmem
= &sysctl_udp_rmem_min
,
2282 .obj_size
= sizeof(struct udp_sock
),
2283 .slab_flags
= SLAB_DESTROY_BY_RCU
,
2284 .h
.udp_table
= &udp_table
,
2285 #ifdef CONFIG_COMPAT
2286 .compat_setsockopt
= compat_udp_setsockopt
,
2287 .compat_getsockopt
= compat_udp_getsockopt
,
2289 .clear_sk
= sk_prot_clear_portaddr_nulls
,
2291 EXPORT_SYMBOL(udp_prot
);
2293 /* ------------------------------------------------------------------------ */
2294 #ifdef CONFIG_PROC_FS
2296 static struct sock
*udp_get_first(struct seq_file
*seq
, int start
)
2299 struct udp_iter_state
*state
= seq
->private;
2300 struct net
*net
= seq_file_net(seq
);
2302 for (state
->bucket
= start
; state
->bucket
<= state
->udp_table
->mask
;
2304 struct hlist_nulls_node
*node
;
2305 struct udp_hslot
*hslot
= &state
->udp_table
->hash
[state
->bucket
];
2307 if (hlist_nulls_empty(&hslot
->head
))
2310 spin_lock_bh(&hslot
->lock
);
2311 sk_nulls_for_each(sk
, node
, &hslot
->head
) {
2312 if (!net_eq(sock_net(sk
), net
))
2314 if (sk
->sk_family
== state
->family
)
2317 spin_unlock_bh(&hslot
->lock
);
2324 static struct sock
*udp_get_next(struct seq_file
*seq
, struct sock
*sk
)
2326 struct udp_iter_state
*state
= seq
->private;
2327 struct net
*net
= seq_file_net(seq
);
2330 sk
= sk_nulls_next(sk
);
2331 } while (sk
&& (!net_eq(sock_net(sk
), net
) || sk
->sk_family
!= state
->family
));
2334 if (state
->bucket
<= state
->udp_table
->mask
)
2335 spin_unlock_bh(&state
->udp_table
->hash
[state
->bucket
].lock
);
2336 return udp_get_first(seq
, state
->bucket
+ 1);
2341 static struct sock
*udp_get_idx(struct seq_file
*seq
, loff_t pos
)
2343 struct sock
*sk
= udp_get_first(seq
, 0);
2346 while (pos
&& (sk
= udp_get_next(seq
, sk
)) != NULL
)
2348 return pos
? NULL
: sk
;
2351 static void *udp_seq_start(struct seq_file
*seq
, loff_t
*pos
)
2353 struct udp_iter_state
*state
= seq
->private;
2354 state
->bucket
= MAX_UDP_PORTS
;
2356 return *pos
? udp_get_idx(seq
, *pos
-1) : SEQ_START_TOKEN
;
2359 static void *udp_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
2363 if (v
== SEQ_START_TOKEN
)
2364 sk
= udp_get_idx(seq
, 0);
2366 sk
= udp_get_next(seq
, v
);
2372 static void udp_seq_stop(struct seq_file
*seq
, void *v
)
2374 struct udp_iter_state
*state
= seq
->private;
2376 if (state
->bucket
<= state
->udp_table
->mask
)
2377 spin_unlock_bh(&state
->udp_table
->hash
[state
->bucket
].lock
);
2380 int udp_seq_open(struct inode
*inode
, struct file
*file
)
2382 struct udp_seq_afinfo
*afinfo
= PDE_DATA(inode
);
2383 struct udp_iter_state
*s
;
2386 err
= seq_open_net(inode
, file
, &afinfo
->seq_ops
,
2387 sizeof(struct udp_iter_state
));
2391 s
= ((struct seq_file
*)file
->private_data
)->private;
2392 s
->family
= afinfo
->family
;
2393 s
->udp_table
= afinfo
->udp_table
;
2396 EXPORT_SYMBOL(udp_seq_open
);
2398 /* ------------------------------------------------------------------------ */
2399 int udp_proc_register(struct net
*net
, struct udp_seq_afinfo
*afinfo
)
2401 struct proc_dir_entry
*p
;
2404 afinfo
->seq_ops
.start
= udp_seq_start
;
2405 afinfo
->seq_ops
.next
= udp_seq_next
;
2406 afinfo
->seq_ops
.stop
= udp_seq_stop
;
2408 p
= proc_create_data(afinfo
->name
, S_IRUGO
, net
->proc_net
,
2409 afinfo
->seq_fops
, afinfo
);
2414 EXPORT_SYMBOL(udp_proc_register
);
2416 void udp_proc_unregister(struct net
*net
, struct udp_seq_afinfo
*afinfo
)
2418 remove_proc_entry(afinfo
->name
, net
->proc_net
);
2420 EXPORT_SYMBOL(udp_proc_unregister
);
2422 /* ------------------------------------------------------------------------ */
2423 static void udp4_format_sock(struct sock
*sp
, struct seq_file
*f
,
2426 struct inet_sock
*inet
= inet_sk(sp
);
2427 __be32 dest
= inet
->inet_daddr
;
2428 __be32 src
= inet
->inet_rcv_saddr
;
2429 __u16 destp
= ntohs(inet
->inet_dport
);
2430 __u16 srcp
= ntohs(inet
->inet_sport
);
2432 seq_printf(f
, "%5d: %08X:%04X %08X:%04X"
2433 " %02X %08X:%08X %02X:%08lX %08X %5u %8d %lu %d %pK %d",
2434 bucket
, src
, srcp
, dest
, destp
, sp
->sk_state
,
2435 sk_wmem_alloc_get(sp
),
2436 sk_rmem_alloc_get(sp
),
2438 from_kuid_munged(seq_user_ns(f
), sock_i_uid(sp
)),
2440 atomic_read(&sp
->sk_refcnt
), sp
,
2441 atomic_read(&sp
->sk_drops
));
2444 int udp4_seq_show(struct seq_file
*seq
, void *v
)
2446 seq_setwidth(seq
, 127);
2447 if (v
== SEQ_START_TOKEN
)
2448 seq_puts(seq
, " sl local_address rem_address st tx_queue "
2449 "rx_queue tr tm->when retrnsmt uid timeout "
2450 "inode ref pointer drops");
2452 struct udp_iter_state
*state
= seq
->private;
2454 udp4_format_sock(v
, seq
, state
->bucket
);
2460 static const struct file_operations udp_afinfo_seq_fops
= {
2461 .owner
= THIS_MODULE
,
2462 .open
= udp_seq_open
,
2464 .llseek
= seq_lseek
,
2465 .release
= seq_release_net
2468 /* ------------------------------------------------------------------------ */
2469 static struct udp_seq_afinfo udp4_seq_afinfo
= {
2472 .udp_table
= &udp_table
,
2473 .seq_fops
= &udp_afinfo_seq_fops
,
2475 .show
= udp4_seq_show
,
2479 static int __net_init
udp4_proc_init_net(struct net
*net
)
2481 return udp_proc_register(net
, &udp4_seq_afinfo
);
2484 static void __net_exit
udp4_proc_exit_net(struct net
*net
)
2486 udp_proc_unregister(net
, &udp4_seq_afinfo
);
2489 static struct pernet_operations udp4_net_ops
= {
2490 .init
= udp4_proc_init_net
,
2491 .exit
= udp4_proc_exit_net
,
2494 int __init
udp4_proc_init(void)
2496 return register_pernet_subsys(&udp4_net_ops
);
2499 void udp4_proc_exit(void)
2501 unregister_pernet_subsys(&udp4_net_ops
);
2503 #endif /* CONFIG_PROC_FS */
2505 static __initdata
unsigned long uhash_entries
;
2506 static int __init
set_uhash_entries(char *str
)
2513 ret
= kstrtoul(str
, 0, &uhash_entries
);
2517 if (uhash_entries
&& uhash_entries
< UDP_HTABLE_SIZE_MIN
)
2518 uhash_entries
= UDP_HTABLE_SIZE_MIN
;
2521 __setup("uhash_entries=", set_uhash_entries
);
2523 void __init
udp_table_init(struct udp_table
*table
, const char *name
)
2527 table
->hash
= alloc_large_system_hash(name
,
2528 2 * sizeof(struct udp_hslot
),
2530 21, /* one slot per 2 MB */
2534 UDP_HTABLE_SIZE_MIN
,
2537 table
->hash2
= table
->hash
+ (table
->mask
+ 1);
2538 for (i
= 0; i
<= table
->mask
; i
++) {
2539 INIT_HLIST_NULLS_HEAD(&table
->hash
[i
].head
, i
);
2540 table
->hash
[i
].count
= 0;
2541 spin_lock_init(&table
->hash
[i
].lock
);
2543 for (i
= 0; i
<= table
->mask
; i
++) {
2544 INIT_HLIST_NULLS_HEAD(&table
->hash2
[i
].head
, i
);
2545 table
->hash2
[i
].count
= 0;
2546 spin_lock_init(&table
->hash2
[i
].lock
);
2550 u32
udp_flow_hashrnd(void)
2552 static u32 hashrnd __read_mostly
;
2554 net_get_random_once(&hashrnd
, sizeof(hashrnd
));
2558 EXPORT_SYMBOL(udp_flow_hashrnd
);
2560 void __init
udp_init(void)
2562 unsigned long limit
;
2564 udp_table_init(&udp_table
, "UDP");
2565 limit
= nr_free_buffer_pages() / 8;
2566 limit
= max(limit
, 128UL);
2567 sysctl_udp_mem
[0] = limit
/ 4 * 3;
2568 sysctl_udp_mem
[1] = limit
;
2569 sysctl_udp_mem
[2] = sysctl_udp_mem
[0] * 2;
2571 sysctl_udp_rmem_min
= SK_MEM_QUANTUM
;
2572 sysctl_udp_wmem_min
= SK_MEM_QUANTUM
;