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>
94 #include <linux/errno.h>
95 #include <linux/timer.h>
97 #include <linux/inet.h>
98 #include <linux/netdevice.h>
99 #include <linux/slab.h>
100 #include <net/tcp_states.h>
101 #include <linux/skbuff.h>
102 #include <linux/netdevice.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 unsigned int udp4_portaddr_hash(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
, __be32 saddr
,
341 __be16 sport
, __be32 daddr
, __be16 dport
, int dif
)
345 if (net_eq(sock_net(sk
), net
) && udp_sk(sk
)->udp_port_hash
== hnum
&&
346 !ipv6_only_sock(sk
)) {
347 struct inet_sock
*inet
= inet_sk(sk
);
349 score
= (sk
->sk_family
== PF_INET
? 2 : 1);
350 if (inet
->inet_rcv_saddr
) {
351 if (inet
->inet_rcv_saddr
!= daddr
)
355 if (inet
->inet_daddr
) {
356 if (inet
->inet_daddr
!= saddr
)
360 if (inet
->inet_dport
) {
361 if (inet
->inet_dport
!= sport
)
365 if (sk
->sk_bound_dev_if
) {
366 if (sk
->sk_bound_dev_if
!= dif
)
375 * In this second variant, we check (daddr, dport) matches (inet_rcv_sadd, inet_num)
377 static inline int compute_score2(struct sock
*sk
, struct net
*net
,
378 __be32 saddr
, __be16 sport
,
379 __be32 daddr
, unsigned int hnum
, int dif
)
383 if (net_eq(sock_net(sk
), net
) && !ipv6_only_sock(sk
)) {
384 struct inet_sock
*inet
= inet_sk(sk
);
386 if (inet
->inet_rcv_saddr
!= daddr
)
388 if (inet
->inet_num
!= hnum
)
391 score
= (sk
->sk_family
== PF_INET
? 2 : 1);
392 if (inet
->inet_daddr
) {
393 if (inet
->inet_daddr
!= saddr
)
397 if (inet
->inet_dport
) {
398 if (inet
->inet_dport
!= sport
)
402 if (sk
->sk_bound_dev_if
) {
403 if (sk
->sk_bound_dev_if
!= dif
)
411 static unsigned int udp_ehashfn(struct net
*net
, const __be32 laddr
,
412 const __u16 lport
, const __be32 faddr
,
415 static u32 udp_ehash_secret __read_mostly
;
417 net_get_random_once(&udp_ehash_secret
, sizeof(udp_ehash_secret
));
419 return __inet_ehashfn(laddr
, lport
, faddr
, fport
,
420 udp_ehash_secret
+ net_hash_mix(net
));
424 /* called with read_rcu_lock() */
425 static struct sock
*udp4_lib_lookup2(struct net
*net
,
426 __be32 saddr
, __be16 sport
,
427 __be32 daddr
, unsigned int hnum
, int dif
,
428 struct udp_hslot
*hslot2
, unsigned int slot2
)
430 struct sock
*sk
, *result
;
431 struct hlist_nulls_node
*node
;
432 int score
, badness
, matches
= 0, reuseport
= 0;
438 udp_portaddr_for_each_entry_rcu(sk
, node
, &hslot2
->head
) {
439 score
= compute_score2(sk
, net
, saddr
, sport
,
441 if (score
> badness
) {
444 reuseport
= sk
->sk_reuseport
;
446 hash
= udp_ehashfn(net
, daddr
, hnum
,
450 } else if (score
== badness
&& reuseport
) {
452 if (reciprocal_scale(hash
, matches
) == 0)
454 hash
= next_pseudo_random32(hash
);
458 * if the nulls value we got at the end of this lookup is
459 * not the expected one, we must restart lookup.
460 * We probably met an item that was moved to another chain.
462 if (get_nulls_value(node
) != slot2
)
465 if (unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
467 else if (unlikely(compute_score2(result
, net
, saddr
, sport
,
468 daddr
, hnum
, dif
) < badness
)) {
476 /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
477 * harder than this. -DaveM
479 struct sock
*__udp4_lib_lookup(struct net
*net
, __be32 saddr
,
480 __be16 sport
, __be32 daddr
, __be16 dport
,
481 int dif
, struct udp_table
*udptable
)
483 struct sock
*sk
, *result
;
484 struct hlist_nulls_node
*node
;
485 unsigned short hnum
= ntohs(dport
);
486 unsigned int hash2
, slot2
, slot
= udp_hashfn(net
, hnum
, udptable
->mask
);
487 struct udp_hslot
*hslot2
, *hslot
= &udptable
->hash
[slot
];
488 int score
, badness
, matches
= 0, reuseport
= 0;
492 if (hslot
->count
> 10) {
493 hash2
= udp4_portaddr_hash(net
, daddr
, hnum
);
494 slot2
= hash2
& udptable
->mask
;
495 hslot2
= &udptable
->hash2
[slot2
];
496 if (hslot
->count
< hslot2
->count
)
499 result
= udp4_lib_lookup2(net
, saddr
, sport
,
503 hash2
= udp4_portaddr_hash(net
, htonl(INADDR_ANY
), hnum
);
504 slot2
= hash2
& udptable
->mask
;
505 hslot2
= &udptable
->hash2
[slot2
];
506 if (hslot
->count
< hslot2
->count
)
509 result
= udp4_lib_lookup2(net
, saddr
, sport
,
510 htonl(INADDR_ANY
), hnum
, dif
,
519 sk_nulls_for_each_rcu(sk
, node
, &hslot
->head
) {
520 score
= compute_score(sk
, net
, saddr
, hnum
, sport
,
522 if (score
> badness
) {
525 reuseport
= sk
->sk_reuseport
;
527 hash
= udp_ehashfn(net
, daddr
, hnum
,
531 } else if (score
== badness
&& reuseport
) {
533 if (reciprocal_scale(hash
, matches
) == 0)
535 hash
= next_pseudo_random32(hash
);
539 * if the nulls value we got at the end of this lookup is
540 * not the expected one, we must restart lookup.
541 * We probably met an item that was moved to another chain.
543 if (get_nulls_value(node
) != slot
)
547 if (unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
549 else if (unlikely(compute_score(result
, net
, saddr
, hnum
, sport
,
550 daddr
, dport
, dif
) < badness
)) {
558 EXPORT_SYMBOL_GPL(__udp4_lib_lookup
);
560 static inline struct sock
*__udp4_lib_lookup_skb(struct sk_buff
*skb
,
561 __be16 sport
, __be16 dport
,
562 struct udp_table
*udptable
)
564 const struct iphdr
*iph
= ip_hdr(skb
);
566 return __udp4_lib_lookup(dev_net(skb_dst(skb
)->dev
), iph
->saddr
, sport
,
567 iph
->daddr
, dport
, inet_iif(skb
),
571 struct sock
*udp4_lib_lookup(struct net
*net
, __be32 saddr
, __be16 sport
,
572 __be32 daddr
, __be16 dport
, int dif
)
574 return __udp4_lib_lookup(net
, saddr
, sport
, daddr
, dport
, dif
, &udp_table
);
576 EXPORT_SYMBOL_GPL(udp4_lib_lookup
);
578 static inline bool __udp_is_mcast_sock(struct net
*net
, struct sock
*sk
,
579 __be16 loc_port
, __be32 loc_addr
,
580 __be16 rmt_port
, __be32 rmt_addr
,
581 int dif
, unsigned short hnum
)
583 struct inet_sock
*inet
= inet_sk(sk
);
585 if (!net_eq(sock_net(sk
), net
) ||
586 udp_sk(sk
)->udp_port_hash
!= hnum
||
587 (inet
->inet_daddr
&& inet
->inet_daddr
!= rmt_addr
) ||
588 (inet
->inet_dport
!= rmt_port
&& inet
->inet_dport
) ||
589 (inet
->inet_rcv_saddr
&& inet
->inet_rcv_saddr
!= loc_addr
) ||
590 ipv6_only_sock(sk
) ||
591 (sk
->sk_bound_dev_if
&& sk
->sk_bound_dev_if
!= dif
))
593 if (!ip_mc_sf_allow(sk
, loc_addr
, rmt_addr
, dif
))
599 * This routine is called by the ICMP module when it gets some
600 * sort of error condition. If err < 0 then the socket should
601 * be closed and the error returned to the user. If err > 0
602 * it's just the icmp type << 8 | icmp code.
603 * Header points to the ip header of the error packet. We move
604 * on past this. Then (as it used to claim before adjustment)
605 * header points to the first 8 bytes of the udp header. We need
606 * to find the appropriate port.
609 void __udp4_lib_err(struct sk_buff
*skb
, u32 info
, struct udp_table
*udptable
)
611 struct inet_sock
*inet
;
612 const struct iphdr
*iph
= (const struct iphdr
*)skb
->data
;
613 struct udphdr
*uh
= (struct udphdr
*)(skb
->data
+(iph
->ihl
<<2));
614 const int type
= icmp_hdr(skb
)->type
;
615 const int code
= icmp_hdr(skb
)->code
;
619 struct net
*net
= dev_net(skb
->dev
);
621 sk
= __udp4_lib_lookup(net
, iph
->daddr
, uh
->dest
,
622 iph
->saddr
, uh
->source
, skb
->dev
->ifindex
, udptable
);
624 ICMP_INC_STATS_BH(net
, ICMP_MIB_INERRORS
);
625 return; /* No socket for error */
634 case ICMP_TIME_EXCEEDED
:
637 case ICMP_SOURCE_QUENCH
:
639 case ICMP_PARAMETERPROB
:
643 case ICMP_DEST_UNREACH
:
644 if (code
== ICMP_FRAG_NEEDED
) { /* Path MTU discovery */
645 ipv4_sk_update_pmtu(skb
, sk
, info
);
646 if (inet
->pmtudisc
!= IP_PMTUDISC_DONT
) {
654 if (code
<= NR_ICMP_UNREACH
) {
655 harderr
= icmp_err_convert
[code
].fatal
;
656 err
= icmp_err_convert
[code
].errno
;
660 ipv4_sk_redirect(skb
, sk
);
665 * RFC1122: OK. Passes ICMP errors back to application, as per
668 if (!inet
->recverr
) {
669 if (!harderr
|| sk
->sk_state
!= TCP_ESTABLISHED
)
672 ip_icmp_error(sk
, skb
, err
, uh
->dest
, info
, (u8
*)(uh
+1));
675 sk
->sk_error_report(sk
);
680 void udp_err(struct sk_buff
*skb
, u32 info
)
682 __udp4_lib_err(skb
, info
, &udp_table
);
686 * Throw away all pending data and cancel the corking. Socket is locked.
688 void udp_flush_pending_frames(struct sock
*sk
)
690 struct udp_sock
*up
= udp_sk(sk
);
695 ip_flush_pending_frames(sk
);
698 EXPORT_SYMBOL(udp_flush_pending_frames
);
701 * udp4_hwcsum - handle outgoing HW checksumming
702 * @skb: sk_buff containing the filled-in UDP header
703 * (checksum field must be zeroed out)
704 * @src: source IP address
705 * @dst: destination IP address
707 void udp4_hwcsum(struct sk_buff
*skb
, __be32 src
, __be32 dst
)
709 struct udphdr
*uh
= udp_hdr(skb
);
710 int offset
= skb_transport_offset(skb
);
711 int len
= skb
->len
- offset
;
715 if (!skb_has_frag_list(skb
)) {
717 * Only one fragment on the socket.
719 skb
->csum_start
= skb_transport_header(skb
) - skb
->head
;
720 skb
->csum_offset
= offsetof(struct udphdr
, check
);
721 uh
->check
= ~csum_tcpudp_magic(src
, dst
, len
,
724 struct sk_buff
*frags
;
727 * HW-checksum won't work as there are two or more
728 * fragments on the socket so that all csums of sk_buffs
731 skb_walk_frags(skb
, frags
) {
732 csum
= csum_add(csum
, frags
->csum
);
736 csum
= skb_checksum(skb
, offset
, hlen
, csum
);
737 skb
->ip_summed
= CHECKSUM_NONE
;
739 uh
->check
= csum_tcpudp_magic(src
, dst
, len
, IPPROTO_UDP
, csum
);
741 uh
->check
= CSUM_MANGLED_0
;
744 EXPORT_SYMBOL_GPL(udp4_hwcsum
);
746 /* Function to set UDP checksum for an IPv4 UDP packet. This is intended
747 * for the simple case like when setting the checksum for a UDP tunnel.
749 void udp_set_csum(bool nocheck
, struct sk_buff
*skb
,
750 __be32 saddr
, __be32 daddr
, int len
)
752 struct udphdr
*uh
= udp_hdr(skb
);
756 else if (skb_is_gso(skb
))
757 uh
->check
= ~udp_v4_check(len
, saddr
, daddr
, 0);
758 else if (skb_dst(skb
) && skb_dst(skb
)->dev
&&
759 (skb_dst(skb
)->dev
->features
& NETIF_F_V4_CSUM
)) {
761 BUG_ON(skb
->ip_summed
== CHECKSUM_PARTIAL
);
763 skb
->ip_summed
= CHECKSUM_PARTIAL
;
764 skb
->csum_start
= skb_transport_header(skb
) - skb
->head
;
765 skb
->csum_offset
= offsetof(struct udphdr
, check
);
766 uh
->check
= ~udp_v4_check(len
, saddr
, daddr
, 0);
770 BUG_ON(skb
->ip_summed
== CHECKSUM_PARTIAL
);
773 csum
= skb_checksum(skb
, 0, len
, 0);
774 uh
->check
= udp_v4_check(len
, saddr
, daddr
, csum
);
776 uh
->check
= CSUM_MANGLED_0
;
778 skb
->ip_summed
= CHECKSUM_UNNECESSARY
;
781 EXPORT_SYMBOL(udp_set_csum
);
783 static int udp_send_skb(struct sk_buff
*skb
, struct flowi4
*fl4
)
785 struct sock
*sk
= skb
->sk
;
786 struct inet_sock
*inet
= inet_sk(sk
);
789 int is_udplite
= IS_UDPLITE(sk
);
790 int offset
= skb_transport_offset(skb
);
791 int len
= skb
->len
- offset
;
795 * Create a UDP header
798 uh
->source
= inet
->inet_sport
;
799 uh
->dest
= fl4
->fl4_dport
;
800 uh
->len
= htons(len
);
803 if (is_udplite
) /* UDP-Lite */
804 csum
= udplite_csum(skb
);
806 else if (sk
->sk_no_check_tx
) { /* UDP csum disabled */
808 skb
->ip_summed
= CHECKSUM_NONE
;
811 } else if (skb
->ip_summed
== CHECKSUM_PARTIAL
) { /* UDP hardware csum */
813 udp4_hwcsum(skb
, fl4
->saddr
, fl4
->daddr
);
817 csum
= udp_csum(skb
);
819 /* add protocol-dependent pseudo-header */
820 uh
->check
= csum_tcpudp_magic(fl4
->saddr
, fl4
->daddr
, len
,
821 sk
->sk_protocol
, csum
);
823 uh
->check
= CSUM_MANGLED_0
;
826 err
= ip_send_skb(sock_net(sk
), skb
);
828 if (err
== -ENOBUFS
&& !inet
->recverr
) {
829 UDP_INC_STATS_USER(sock_net(sk
),
830 UDP_MIB_SNDBUFERRORS
, is_udplite
);
834 UDP_INC_STATS_USER(sock_net(sk
),
835 UDP_MIB_OUTDATAGRAMS
, is_udplite
);
840 * Push out all pending data as one UDP datagram. Socket is locked.
842 int udp_push_pending_frames(struct sock
*sk
)
844 struct udp_sock
*up
= udp_sk(sk
);
845 struct inet_sock
*inet
= inet_sk(sk
);
846 struct flowi4
*fl4
= &inet
->cork
.fl
.u
.ip4
;
850 skb
= ip_finish_skb(sk
, fl4
);
854 err
= udp_send_skb(skb
, fl4
);
861 EXPORT_SYMBOL(udp_push_pending_frames
);
863 int udp_sendmsg(struct kiocb
*iocb
, struct sock
*sk
, struct msghdr
*msg
,
866 struct inet_sock
*inet
= inet_sk(sk
);
867 struct udp_sock
*up
= udp_sk(sk
);
868 struct flowi4 fl4_stack
;
871 struct ipcm_cookie ipc
;
872 struct rtable
*rt
= NULL
;
875 __be32 daddr
, faddr
, saddr
;
878 int err
, is_udplite
= IS_UDPLITE(sk
);
879 int corkreq
= up
->corkflag
|| msg
->msg_flags
&MSG_MORE
;
880 int (*getfrag
)(void *, char *, int, int, int, struct sk_buff
*);
882 struct ip_options_data opt_copy
;
891 if (msg
->msg_flags
& MSG_OOB
) /* Mirror BSD error message compatibility */
899 getfrag
= is_udplite
? udplite_getfrag
: ip_generic_getfrag
;
901 fl4
= &inet
->cork
.fl
.u
.ip4
;
904 * There are pending frames.
905 * The socket lock must be held while it's corked.
908 if (likely(up
->pending
)) {
909 if (unlikely(up
->pending
!= AF_INET
)) {
917 ulen
+= sizeof(struct udphdr
);
920 * Get and verify the address.
923 DECLARE_SOCKADDR(struct sockaddr_in
*, usin
, msg
->msg_name
);
924 if (msg
->msg_namelen
< sizeof(*usin
))
926 if (usin
->sin_family
!= AF_INET
) {
927 if (usin
->sin_family
!= AF_UNSPEC
)
928 return -EAFNOSUPPORT
;
931 daddr
= usin
->sin_addr
.s_addr
;
932 dport
= usin
->sin_port
;
936 if (sk
->sk_state
!= TCP_ESTABLISHED
)
937 return -EDESTADDRREQ
;
938 daddr
= inet
->inet_daddr
;
939 dport
= inet
->inet_dport
;
940 /* Open fast path for connected socket.
941 Route will not be used, if at least one option is set.
945 ipc
.addr
= inet
->inet_saddr
;
947 ipc
.oif
= sk
->sk_bound_dev_if
;
949 sock_tx_timestamp(sk
, &ipc
.tx_flags
);
951 if (msg
->msg_controllen
) {
952 err
= ip_cmsg_send(sock_net(sk
), msg
, &ipc
,
953 sk
->sk_family
== AF_INET6
);
961 struct ip_options_rcu
*inet_opt
;
964 inet_opt
= rcu_dereference(inet
->inet_opt
);
966 memcpy(&opt_copy
, inet_opt
,
967 sizeof(*inet_opt
) + inet_opt
->opt
.optlen
);
968 ipc
.opt
= &opt_copy
.opt
;
974 ipc
.addr
= faddr
= daddr
;
976 if (ipc
.opt
&& ipc
.opt
->opt
.srr
) {
979 faddr
= ipc
.opt
->opt
.faddr
;
982 tos
= get_rttos(&ipc
, inet
);
983 if (sock_flag(sk
, SOCK_LOCALROUTE
) ||
984 (msg
->msg_flags
& MSG_DONTROUTE
) ||
985 (ipc
.opt
&& ipc
.opt
->opt
.is_strictroute
)) {
990 if (ipv4_is_multicast(daddr
)) {
992 ipc
.oif
= inet
->mc_index
;
994 saddr
= inet
->mc_addr
;
997 ipc
.oif
= inet
->uc_index
;
1000 rt
= (struct rtable
*)sk_dst_check(sk
, 0);
1003 struct net
*net
= sock_net(sk
);
1006 flowi4_init_output(fl4
, ipc
.oif
, sk
->sk_mark
, tos
,
1007 RT_SCOPE_UNIVERSE
, sk
->sk_protocol
,
1008 inet_sk_flowi_flags(sk
),
1009 faddr
, saddr
, dport
, inet
->inet_sport
);
1011 security_sk_classify_flow(sk
, flowi4_to_flowi(fl4
));
1012 rt
= ip_route_output_flow(net
, fl4
, sk
);
1016 if (err
== -ENETUNREACH
)
1017 IP_INC_STATS(net
, IPSTATS_MIB_OUTNOROUTES
);
1022 if ((rt
->rt_flags
& RTCF_BROADCAST
) &&
1023 !sock_flag(sk
, SOCK_BROADCAST
))
1026 sk_dst_set(sk
, dst_clone(&rt
->dst
));
1029 if (msg
->msg_flags
&MSG_CONFIRM
)
1035 daddr
= ipc
.addr
= fl4
->daddr
;
1037 /* Lockless fast path for the non-corking case. */
1039 skb
= ip_make_skb(sk
, fl4
, getfrag
, msg
->msg_iov
, ulen
,
1040 sizeof(struct udphdr
), &ipc
, &rt
,
1043 if (!IS_ERR_OR_NULL(skb
))
1044 err
= udp_send_skb(skb
, fl4
);
1049 if (unlikely(up
->pending
)) {
1050 /* The socket is already corked while preparing it. */
1051 /* ... which is an evident application bug. --ANK */
1054 net_dbg_ratelimited("cork app bug 2\n");
1059 * Now cork the socket to pend data.
1061 fl4
= &inet
->cork
.fl
.u
.ip4
;
1064 fl4
->fl4_dport
= dport
;
1065 fl4
->fl4_sport
= inet
->inet_sport
;
1066 up
->pending
= AF_INET
;
1070 err
= ip_append_data(sk
, fl4
, getfrag
, msg
->msg_iov
, ulen
,
1071 sizeof(struct udphdr
), &ipc
, &rt
,
1072 corkreq
? msg
->msg_flags
|MSG_MORE
: msg
->msg_flags
);
1074 udp_flush_pending_frames(sk
);
1076 err
= udp_push_pending_frames(sk
);
1077 else if (unlikely(skb_queue_empty(&sk
->sk_write_queue
)))
1088 * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
1089 * ENOBUFS might not be good (it's not tunable per se), but otherwise
1090 * we don't have a good statistic (IpOutDiscards but it can be too many
1091 * things). We could add another new stat but at least for now that
1092 * seems like overkill.
1094 if (err
== -ENOBUFS
|| test_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
)) {
1095 UDP_INC_STATS_USER(sock_net(sk
),
1096 UDP_MIB_SNDBUFERRORS
, is_udplite
);
1101 dst_confirm(&rt
->dst
);
1102 if (!(msg
->msg_flags
&MSG_PROBE
) || len
)
1103 goto back_from_confirm
;
1107 EXPORT_SYMBOL(udp_sendmsg
);
1109 int udp_sendpage(struct sock
*sk
, struct page
*page
, int offset
,
1110 size_t size
, int flags
)
1112 struct inet_sock
*inet
= inet_sk(sk
);
1113 struct udp_sock
*up
= udp_sk(sk
);
1116 if (flags
& MSG_SENDPAGE_NOTLAST
)
1120 struct msghdr msg
= { .msg_flags
= flags
|MSG_MORE
};
1122 /* Call udp_sendmsg to specify destination address which
1123 * sendpage interface can't pass.
1124 * This will succeed only when the socket is connected.
1126 ret
= udp_sendmsg(NULL
, sk
, &msg
, 0);
1133 if (unlikely(!up
->pending
)) {
1136 net_dbg_ratelimited("udp cork app bug 3\n");
1140 ret
= ip_append_page(sk
, &inet
->cork
.fl
.u
.ip4
,
1141 page
, offset
, size
, flags
);
1142 if (ret
== -EOPNOTSUPP
) {
1144 return sock_no_sendpage(sk
->sk_socket
, page
, offset
,
1148 udp_flush_pending_frames(sk
);
1153 if (!(up
->corkflag
|| (flags
&MSG_MORE
)))
1154 ret
= udp_push_pending_frames(sk
);
1164 * first_packet_length - return length of first packet in receive queue
1167 * Drops all bad checksum frames, until a valid one is found.
1168 * Returns the length of found skb, or 0 if none is found.
1170 static unsigned int first_packet_length(struct sock
*sk
)
1172 struct sk_buff_head list_kill
, *rcvq
= &sk
->sk_receive_queue
;
1173 struct sk_buff
*skb
;
1176 __skb_queue_head_init(&list_kill
);
1178 spin_lock_bh(&rcvq
->lock
);
1179 while ((skb
= skb_peek(rcvq
)) != NULL
&&
1180 udp_lib_checksum_complete(skb
)) {
1181 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_CSUMERRORS
,
1183 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
,
1185 atomic_inc(&sk
->sk_drops
);
1186 __skb_unlink(skb
, rcvq
);
1187 __skb_queue_tail(&list_kill
, skb
);
1189 res
= skb
? skb
->len
: 0;
1190 spin_unlock_bh(&rcvq
->lock
);
1192 if (!skb_queue_empty(&list_kill
)) {
1193 bool slow
= lock_sock_fast(sk
);
1195 __skb_queue_purge(&list_kill
);
1196 sk_mem_reclaim_partial(sk
);
1197 unlock_sock_fast(sk
, slow
);
1203 * IOCTL requests applicable to the UDP protocol
1206 int udp_ioctl(struct sock
*sk
, int cmd
, unsigned long arg
)
1211 int amount
= sk_wmem_alloc_get(sk
);
1213 return put_user(amount
, (int __user
*)arg
);
1218 unsigned int amount
= first_packet_length(sk
);
1222 * We will only return the amount
1223 * of this packet since that is all
1224 * that will be read.
1226 amount
-= sizeof(struct udphdr
);
1228 return put_user(amount
, (int __user
*)arg
);
1232 return -ENOIOCTLCMD
;
1237 EXPORT_SYMBOL(udp_ioctl
);
1240 * This should be easy, if there is something there we
1241 * return it, otherwise we block.
1244 int udp_recvmsg(struct kiocb
*iocb
, struct sock
*sk
, struct msghdr
*msg
,
1245 size_t len
, int noblock
, int flags
, int *addr_len
)
1247 struct inet_sock
*inet
= inet_sk(sk
);
1248 DECLARE_SOCKADDR(struct sockaddr_in
*, sin
, msg
->msg_name
);
1249 struct sk_buff
*skb
;
1250 unsigned int ulen
, copied
;
1251 int peeked
, off
= 0;
1253 int is_udplite
= IS_UDPLITE(sk
);
1256 if (flags
& MSG_ERRQUEUE
)
1257 return ip_recv_error(sk
, msg
, len
, addr_len
);
1260 skb
= __skb_recv_datagram(sk
, flags
| (noblock
? MSG_DONTWAIT
: 0),
1261 &peeked
, &off
, &err
);
1265 ulen
= skb
->len
- sizeof(struct udphdr
);
1269 else if (copied
< ulen
)
1270 msg
->msg_flags
|= MSG_TRUNC
;
1273 * If checksum is needed at all, try to do it while copying the
1274 * data. If the data is truncated, or if we only want a partial
1275 * coverage checksum (UDP-Lite), do it before the copy.
1278 if (copied
< ulen
|| UDP_SKB_CB(skb
)->partial_cov
) {
1279 if (udp_lib_checksum_complete(skb
))
1283 if (skb_csum_unnecessary(skb
))
1284 err
= skb_copy_datagram_msg(skb
, sizeof(struct udphdr
),
1287 err
= skb_copy_and_csum_datagram_iovec(skb
,
1288 sizeof(struct udphdr
),
1295 if (unlikely(err
)) {
1296 trace_kfree_skb(skb
, udp_recvmsg
);
1298 atomic_inc(&sk
->sk_drops
);
1299 UDP_INC_STATS_USER(sock_net(sk
),
1300 UDP_MIB_INERRORS
, is_udplite
);
1306 UDP_INC_STATS_USER(sock_net(sk
),
1307 UDP_MIB_INDATAGRAMS
, is_udplite
);
1309 sock_recv_ts_and_drops(msg
, sk
, skb
);
1311 /* Copy the address. */
1313 sin
->sin_family
= AF_INET
;
1314 sin
->sin_port
= udp_hdr(skb
)->source
;
1315 sin
->sin_addr
.s_addr
= ip_hdr(skb
)->saddr
;
1316 memset(sin
->sin_zero
, 0, sizeof(sin
->sin_zero
));
1317 *addr_len
= sizeof(*sin
);
1319 if (inet
->cmsg_flags
)
1320 ip_cmsg_recv(msg
, skb
);
1323 if (flags
& MSG_TRUNC
)
1327 skb_free_datagram_locked(sk
, skb
);
1332 slow
= lock_sock_fast(sk
);
1333 if (!skb_kill_datagram(sk
, skb
, flags
)) {
1334 UDP_INC_STATS_USER(sock_net(sk
), UDP_MIB_CSUMERRORS
, is_udplite
);
1335 UDP_INC_STATS_USER(sock_net(sk
), UDP_MIB_INERRORS
, is_udplite
);
1337 unlock_sock_fast(sk
, slow
);
1342 /* starting over for a new packet */
1343 msg
->msg_flags
&= ~MSG_TRUNC
;
1348 int udp_disconnect(struct sock
*sk
, int flags
)
1350 struct inet_sock
*inet
= inet_sk(sk
);
1352 * 1003.1g - break association.
1355 sk
->sk_state
= TCP_CLOSE
;
1356 inet
->inet_daddr
= 0;
1357 inet
->inet_dport
= 0;
1358 sock_rps_reset_rxhash(sk
);
1359 sk
->sk_bound_dev_if
= 0;
1360 if (!(sk
->sk_userlocks
& SOCK_BINDADDR_LOCK
))
1361 inet_reset_saddr(sk
);
1363 if (!(sk
->sk_userlocks
& SOCK_BINDPORT_LOCK
)) {
1364 sk
->sk_prot
->unhash(sk
);
1365 inet
->inet_sport
= 0;
1370 EXPORT_SYMBOL(udp_disconnect
);
1372 void udp_lib_unhash(struct sock
*sk
)
1374 if (sk_hashed(sk
)) {
1375 struct udp_table
*udptable
= sk
->sk_prot
->h
.udp_table
;
1376 struct udp_hslot
*hslot
, *hslot2
;
1378 hslot
= udp_hashslot(udptable
, sock_net(sk
),
1379 udp_sk(sk
)->udp_port_hash
);
1380 hslot2
= udp_hashslot2(udptable
, udp_sk(sk
)->udp_portaddr_hash
);
1382 spin_lock_bh(&hslot
->lock
);
1383 if (sk_nulls_del_node_init_rcu(sk
)) {
1385 inet_sk(sk
)->inet_num
= 0;
1386 sock_prot_inuse_add(sock_net(sk
), sk
->sk_prot
, -1);
1388 spin_lock(&hslot2
->lock
);
1389 hlist_nulls_del_init_rcu(&udp_sk(sk
)->udp_portaddr_node
);
1391 spin_unlock(&hslot2
->lock
);
1393 spin_unlock_bh(&hslot
->lock
);
1396 EXPORT_SYMBOL(udp_lib_unhash
);
1399 * inet_rcv_saddr was changed, we must rehash secondary hash
1401 void udp_lib_rehash(struct sock
*sk
, u16 newhash
)
1403 if (sk_hashed(sk
)) {
1404 struct udp_table
*udptable
= sk
->sk_prot
->h
.udp_table
;
1405 struct udp_hslot
*hslot
, *hslot2
, *nhslot2
;
1407 hslot2
= udp_hashslot2(udptable
, udp_sk(sk
)->udp_portaddr_hash
);
1408 nhslot2
= udp_hashslot2(udptable
, newhash
);
1409 udp_sk(sk
)->udp_portaddr_hash
= newhash
;
1410 if (hslot2
!= nhslot2
) {
1411 hslot
= udp_hashslot(udptable
, sock_net(sk
),
1412 udp_sk(sk
)->udp_port_hash
);
1413 /* we must lock primary chain too */
1414 spin_lock_bh(&hslot
->lock
);
1416 spin_lock(&hslot2
->lock
);
1417 hlist_nulls_del_init_rcu(&udp_sk(sk
)->udp_portaddr_node
);
1419 spin_unlock(&hslot2
->lock
);
1421 spin_lock(&nhslot2
->lock
);
1422 hlist_nulls_add_head_rcu(&udp_sk(sk
)->udp_portaddr_node
,
1425 spin_unlock(&nhslot2
->lock
);
1427 spin_unlock_bh(&hslot
->lock
);
1431 EXPORT_SYMBOL(udp_lib_rehash
);
1433 static void udp_v4_rehash(struct sock
*sk
)
1435 u16 new_hash
= udp4_portaddr_hash(sock_net(sk
),
1436 inet_sk(sk
)->inet_rcv_saddr
,
1437 inet_sk(sk
)->inet_num
);
1438 udp_lib_rehash(sk
, new_hash
);
1441 static int __udp_queue_rcv_skb(struct sock
*sk
, struct sk_buff
*skb
)
1445 if (inet_sk(sk
)->inet_daddr
) {
1446 sock_rps_save_rxhash(sk
, skb
);
1447 sk_mark_napi_id(sk
, skb
);
1448 sk_incoming_cpu_update(sk
);
1451 rc
= sock_queue_rcv_skb(sk
, skb
);
1453 int is_udplite
= IS_UDPLITE(sk
);
1455 /* Note that an ENOMEM error is charged twice */
1457 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_RCVBUFERRORS
,
1459 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
, is_udplite
);
1461 trace_udp_fail_queue_rcv_skb(rc
, sk
);
1469 static struct static_key udp_encap_needed __read_mostly
;
1470 void udp_encap_enable(void)
1472 if (!static_key_enabled(&udp_encap_needed
))
1473 static_key_slow_inc(&udp_encap_needed
);
1475 EXPORT_SYMBOL(udp_encap_enable
);
1480 * >0: "udp encap" protocol resubmission
1482 * Note that in the success and error cases, the skb is assumed to
1483 * have either been requeued or freed.
1485 int udp_queue_rcv_skb(struct sock
*sk
, struct sk_buff
*skb
)
1487 struct udp_sock
*up
= udp_sk(sk
);
1489 int is_udplite
= IS_UDPLITE(sk
);
1492 * Charge it to the socket, dropping if the queue is full.
1494 if (!xfrm4_policy_check(sk
, XFRM_POLICY_IN
, skb
))
1498 if (static_key_false(&udp_encap_needed
) && up
->encap_type
) {
1499 int (*encap_rcv
)(struct sock
*sk
, struct sk_buff
*skb
);
1502 * This is an encapsulation socket so pass the skb to
1503 * the socket's udp_encap_rcv() hook. Otherwise, just
1504 * fall through and pass this up the UDP socket.
1505 * up->encap_rcv() returns the following value:
1506 * =0 if skb was successfully passed to the encap
1507 * handler or was discarded by it.
1508 * >0 if skb should be passed on to UDP.
1509 * <0 if skb should be resubmitted as proto -N
1512 /* if we're overly short, let UDP handle it */
1513 encap_rcv
= ACCESS_ONCE(up
->encap_rcv
);
1514 if (skb
->len
> sizeof(struct udphdr
) && encap_rcv
!= NULL
) {
1517 /* Verify checksum before giving to encap */
1518 if (udp_lib_checksum_complete(skb
))
1521 ret
= encap_rcv(sk
, skb
);
1523 UDP_INC_STATS_BH(sock_net(sk
),
1524 UDP_MIB_INDATAGRAMS
,
1530 /* FALLTHROUGH -- it's a UDP Packet */
1534 * UDP-Lite specific tests, ignored on UDP sockets
1536 if ((is_udplite
& UDPLITE_RECV_CC
) && UDP_SKB_CB(skb
)->partial_cov
) {
1539 * MIB statistics other than incrementing the error count are
1540 * disabled for the following two types of errors: these depend
1541 * on the application settings, not on the functioning of the
1542 * protocol stack as such.
1544 * RFC 3828 here recommends (sec 3.3): "There should also be a
1545 * way ... to ... at least let the receiving application block
1546 * delivery of packets with coverage values less than a value
1547 * provided by the application."
1549 if (up
->pcrlen
== 0) { /* full coverage was set */
1550 net_dbg_ratelimited("UDPLite: partial coverage %d while full coverage %d requested\n",
1551 UDP_SKB_CB(skb
)->cscov
, skb
->len
);
1554 /* The next case involves violating the min. coverage requested
1555 * by the receiver. This is subtle: if receiver wants x and x is
1556 * greater than the buffersize/MTU then receiver will complain
1557 * that it wants x while sender emits packets of smaller size y.
1558 * Therefore the above ...()->partial_cov statement is essential.
1560 if (UDP_SKB_CB(skb
)->cscov
< up
->pcrlen
) {
1561 net_dbg_ratelimited("UDPLite: coverage %d too small, need min %d\n",
1562 UDP_SKB_CB(skb
)->cscov
, up
->pcrlen
);
1567 if (rcu_access_pointer(sk
->sk_filter
) &&
1568 udp_lib_checksum_complete(skb
))
1572 if (sk_rcvqueues_full(sk
, sk
->sk_rcvbuf
)) {
1573 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_RCVBUFERRORS
,
1580 ipv4_pktinfo_prepare(sk
, skb
);
1582 if (!sock_owned_by_user(sk
))
1583 rc
= __udp_queue_rcv_skb(sk
, skb
);
1584 else if (sk_add_backlog(sk
, skb
, sk
->sk_rcvbuf
)) {
1593 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_CSUMERRORS
, is_udplite
);
1595 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
, is_udplite
);
1596 atomic_inc(&sk
->sk_drops
);
1602 static void flush_stack(struct sock
**stack
, unsigned int count
,
1603 struct sk_buff
*skb
, unsigned int final
)
1606 struct sk_buff
*skb1
= NULL
;
1609 for (i
= 0; i
< count
; i
++) {
1611 if (likely(skb1
== NULL
))
1612 skb1
= (i
== final
) ? skb
: skb_clone(skb
, GFP_ATOMIC
);
1615 atomic_inc(&sk
->sk_drops
);
1616 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_RCVBUFERRORS
,
1618 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
,
1622 if (skb1
&& udp_queue_rcv_skb(sk
, skb1
) <= 0)
1631 /* For TCP sockets, sk_rx_dst is protected by socket lock
1632 * For UDP, we use xchg() to guard against concurrent changes.
1634 static void udp_sk_rx_dst_set(struct sock
*sk
, struct dst_entry
*dst
)
1636 struct dst_entry
*old
;
1639 old
= xchg(&sk
->sk_rx_dst
, dst
);
1644 * Multicasts and broadcasts go to each listener.
1646 * Note: called only from the BH handler context.
1648 static int __udp4_lib_mcast_deliver(struct net
*net
, struct sk_buff
*skb
,
1650 __be32 saddr
, __be32 daddr
,
1651 struct udp_table
*udptable
,
1654 struct sock
*sk
, *stack
[256 / sizeof(struct sock
*)];
1655 struct hlist_nulls_node
*node
;
1656 unsigned short hnum
= ntohs(uh
->dest
);
1657 struct udp_hslot
*hslot
= udp_hashslot(udptable
, net
, hnum
);
1658 int dif
= skb
->dev
->ifindex
;
1659 unsigned int count
= 0, offset
= offsetof(typeof(*sk
), sk_nulls_node
);
1660 unsigned int hash2
= 0, hash2_any
= 0, use_hash2
= (hslot
->count
> 10);
1661 bool inner_flushed
= false;
1664 hash2_any
= udp4_portaddr_hash(net
, htonl(INADDR_ANY
), hnum
) &
1666 hash2
= udp4_portaddr_hash(net
, daddr
, hnum
) & udp_table
.mask
;
1668 hslot
= &udp_table
.hash2
[hash2
];
1669 offset
= offsetof(typeof(*sk
), __sk_common
.skc_portaddr_node
);
1672 spin_lock(&hslot
->lock
);
1673 sk_nulls_for_each_entry_offset(sk
, node
, &hslot
->head
, offset
) {
1674 if (__udp_is_mcast_sock(net
, sk
,
1678 if (unlikely(count
== ARRAY_SIZE(stack
))) {
1679 flush_stack(stack
, count
, skb
, ~0);
1680 inner_flushed
= true;
1683 stack
[count
++] = sk
;
1688 spin_unlock(&hslot
->lock
);
1690 /* Also lookup *:port if we are using hash2 and haven't done so yet. */
1691 if (use_hash2
&& hash2
!= hash2_any
) {
1697 * do the slow work with no lock held
1700 flush_stack(stack
, count
, skb
, count
- 1);
1703 UDP_INC_STATS_BH(net
, UDP_MIB_IGNOREDMULTI
,
1704 proto
== IPPROTO_UDPLITE
);
1710 /* Initialize UDP checksum. If exited with zero value (success),
1711 * CHECKSUM_UNNECESSARY means, that no more checks are required.
1712 * Otherwise, csum completion requires chacksumming packet body,
1713 * including udp header and folding it to skb->csum.
1715 static inline int udp4_csum_init(struct sk_buff
*skb
, struct udphdr
*uh
,
1720 UDP_SKB_CB(skb
)->partial_cov
= 0;
1721 UDP_SKB_CB(skb
)->cscov
= skb
->len
;
1723 if (proto
== IPPROTO_UDPLITE
) {
1724 err
= udplite_checksum_init(skb
, uh
);
1729 return skb_checksum_init_zero_check(skb
, proto
, uh
->check
,
1730 inet_compute_pseudo
);
1734 * All we need to do is get the socket, and then do a checksum.
1737 int __udp4_lib_rcv(struct sk_buff
*skb
, struct udp_table
*udptable
,
1742 unsigned short ulen
;
1743 struct rtable
*rt
= skb_rtable(skb
);
1744 __be32 saddr
, daddr
;
1745 struct net
*net
= dev_net(skb
->dev
);
1748 * Validate the packet.
1750 if (!pskb_may_pull(skb
, sizeof(struct udphdr
)))
1751 goto drop
; /* No space for header. */
1754 ulen
= ntohs(uh
->len
);
1755 saddr
= ip_hdr(skb
)->saddr
;
1756 daddr
= ip_hdr(skb
)->daddr
;
1758 if (ulen
> skb
->len
)
1761 if (proto
== IPPROTO_UDP
) {
1762 /* UDP validates ulen. */
1763 if (ulen
< sizeof(*uh
) || pskb_trim_rcsum(skb
, ulen
))
1768 if (udp4_csum_init(skb
, uh
, proto
))
1771 sk
= skb_steal_sock(skb
);
1773 struct dst_entry
*dst
= skb_dst(skb
);
1776 if (unlikely(sk
->sk_rx_dst
!= dst
))
1777 udp_sk_rx_dst_set(sk
, dst
);
1779 ret
= udp_queue_rcv_skb(sk
, skb
);
1781 /* a return value > 0 means to resubmit the input, but
1782 * it wants the return to be -protocol, or 0
1789 if (rt
->rt_flags
& (RTCF_BROADCAST
|RTCF_MULTICAST
))
1790 return __udp4_lib_mcast_deliver(net
, skb
, uh
,
1791 saddr
, daddr
, udptable
, proto
);
1793 sk
= __udp4_lib_lookup_skb(skb
, uh
->source
, uh
->dest
, udptable
);
1797 if (udp_sk(sk
)->convert_csum
&& uh
->check
&& !IS_UDPLITE(sk
))
1798 skb_checksum_try_convert(skb
, IPPROTO_UDP
, uh
->check
,
1799 inet_compute_pseudo
);
1801 ret
= udp_queue_rcv_skb(sk
, skb
);
1804 /* a return value > 0 means to resubmit the input, but
1805 * it wants the return to be -protocol, or 0
1812 if (!xfrm4_policy_check(NULL
, XFRM_POLICY_IN
, skb
))
1816 /* No socket. Drop packet silently, if checksum is wrong */
1817 if (udp_lib_checksum_complete(skb
))
1820 UDP_INC_STATS_BH(net
, UDP_MIB_NOPORTS
, proto
== IPPROTO_UDPLITE
);
1821 icmp_send(skb
, ICMP_DEST_UNREACH
, ICMP_PORT_UNREACH
, 0);
1824 * Hmm. We got an UDP packet to a port to which we
1825 * don't wanna listen. Ignore it.
1831 net_dbg_ratelimited("UDP%s: short packet: From %pI4:%u %d/%d to %pI4:%u\n",
1832 proto
== IPPROTO_UDPLITE
? "Lite" : "",
1833 &saddr
, ntohs(uh
->source
),
1835 &daddr
, ntohs(uh
->dest
));
1840 * RFC1122: OK. Discards the bad packet silently (as far as
1841 * the network is concerned, anyway) as per 4.1.3.4 (MUST).
1843 net_dbg_ratelimited("UDP%s: bad checksum. From %pI4:%u to %pI4:%u ulen %d\n",
1844 proto
== IPPROTO_UDPLITE
? "Lite" : "",
1845 &saddr
, ntohs(uh
->source
), &daddr
, ntohs(uh
->dest
),
1847 UDP_INC_STATS_BH(net
, UDP_MIB_CSUMERRORS
, proto
== IPPROTO_UDPLITE
);
1849 UDP_INC_STATS_BH(net
, UDP_MIB_INERRORS
, proto
== IPPROTO_UDPLITE
);
1854 /* We can only early demux multicast if there is a single matching socket.
1855 * If more than one socket found returns NULL
1857 static struct sock
*__udp4_lib_mcast_demux_lookup(struct net
*net
,
1858 __be16 loc_port
, __be32 loc_addr
,
1859 __be16 rmt_port
, __be32 rmt_addr
,
1862 struct sock
*sk
, *result
;
1863 struct hlist_nulls_node
*node
;
1864 unsigned short hnum
= ntohs(loc_port
);
1865 unsigned int count
, slot
= udp_hashfn(net
, hnum
, udp_table
.mask
);
1866 struct udp_hslot
*hslot
= &udp_table
.hash
[slot
];
1868 /* Do not bother scanning a too big list */
1869 if (hslot
->count
> 10)
1876 sk_nulls_for_each_rcu(sk
, node
, &hslot
->head
) {
1877 if (__udp_is_mcast_sock(net
, sk
,
1886 * if the nulls value we got at the end of this lookup is
1887 * not the expected one, we must restart lookup.
1888 * We probably met an item that was moved to another chain.
1890 if (get_nulls_value(node
) != slot
)
1895 unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
1897 else if (unlikely(!__udp_is_mcast_sock(net
, result
,
1909 /* For unicast we should only early demux connected sockets or we can
1910 * break forwarding setups. The chains here can be long so only check
1911 * if the first socket is an exact match and if not move on.
1913 static struct sock
*__udp4_lib_demux_lookup(struct net
*net
,
1914 __be16 loc_port
, __be32 loc_addr
,
1915 __be16 rmt_port
, __be32 rmt_addr
,
1918 struct sock
*sk
, *result
;
1919 struct hlist_nulls_node
*node
;
1920 unsigned short hnum
= ntohs(loc_port
);
1921 unsigned int hash2
= udp4_portaddr_hash(net
, loc_addr
, hnum
);
1922 unsigned int slot2
= hash2
& udp_table
.mask
;
1923 struct udp_hslot
*hslot2
= &udp_table
.hash2
[slot2
];
1924 INET_ADDR_COOKIE(acookie
, rmt_addr
, loc_addr
);
1925 const __portpair ports
= INET_COMBINED_PORTS(rmt_port
, hnum
);
1929 udp_portaddr_for_each_entry_rcu(sk
, node
, &hslot2
->head
) {
1930 if (INET_MATCH(sk
, net
, acookie
,
1931 rmt_addr
, loc_addr
, ports
, dif
))
1933 /* Only check first socket in chain */
1938 if (unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
1940 else if (unlikely(!INET_MATCH(sk
, net
, acookie
,
1951 void udp_v4_early_demux(struct sk_buff
*skb
)
1953 struct net
*net
= dev_net(skb
->dev
);
1954 const struct iphdr
*iph
;
1955 const struct udphdr
*uh
;
1957 struct dst_entry
*dst
;
1958 int dif
= skb
->dev
->ifindex
;
1960 /* validate the packet */
1961 if (!pskb_may_pull(skb
, skb_transport_offset(skb
) + sizeof(struct udphdr
)))
1967 if (skb
->pkt_type
== PACKET_BROADCAST
||
1968 skb
->pkt_type
== PACKET_MULTICAST
)
1969 sk
= __udp4_lib_mcast_demux_lookup(net
, uh
->dest
, iph
->daddr
,
1970 uh
->source
, iph
->saddr
, dif
);
1971 else if (skb
->pkt_type
== PACKET_HOST
)
1972 sk
= __udp4_lib_demux_lookup(net
, uh
->dest
, iph
->daddr
,
1973 uh
->source
, iph
->saddr
, dif
);
1981 skb
->destructor
= sock_efree
;
1982 dst
= sk
->sk_rx_dst
;
1985 dst
= dst_check(dst
, 0);
1987 skb_dst_set_noref(skb
, dst
);
1990 int udp_rcv(struct sk_buff
*skb
)
1992 return __udp4_lib_rcv(skb
, &udp_table
, IPPROTO_UDP
);
1995 void udp_destroy_sock(struct sock
*sk
)
1997 struct udp_sock
*up
= udp_sk(sk
);
1998 bool slow
= lock_sock_fast(sk
);
1999 udp_flush_pending_frames(sk
);
2000 unlock_sock_fast(sk
, slow
);
2001 if (static_key_false(&udp_encap_needed
) && up
->encap_type
) {
2002 void (*encap_destroy
)(struct sock
*sk
);
2003 encap_destroy
= ACCESS_ONCE(up
->encap_destroy
);
2010 * Socket option code for UDP
2012 int udp_lib_setsockopt(struct sock
*sk
, int level
, int optname
,
2013 char __user
*optval
, unsigned int optlen
,
2014 int (*push_pending_frames
)(struct sock
*))
2016 struct udp_sock
*up
= udp_sk(sk
);
2019 int is_udplite
= IS_UDPLITE(sk
);
2021 if (optlen
< sizeof(int))
2024 if (get_user(val
, (int __user
*)optval
))
2027 valbool
= val
? 1 : 0;
2036 push_pending_frames(sk
);
2044 case UDP_ENCAP_ESPINUDP
:
2045 case UDP_ENCAP_ESPINUDP_NON_IKE
:
2046 up
->encap_rcv
= xfrm4_udp_encap_rcv
;
2048 case UDP_ENCAP_L2TPINUDP
:
2049 up
->encap_type
= val
;
2058 case UDP_NO_CHECK6_TX
:
2059 up
->no_check6_tx
= valbool
;
2062 case UDP_NO_CHECK6_RX
:
2063 up
->no_check6_rx
= valbool
;
2067 * UDP-Lite's partial checksum coverage (RFC 3828).
2069 /* The sender sets actual checksum coverage length via this option.
2070 * The case coverage > packet length is handled by send module. */
2071 case UDPLITE_SEND_CSCOV
:
2072 if (!is_udplite
) /* Disable the option on UDP sockets */
2073 return -ENOPROTOOPT
;
2074 if (val
!= 0 && val
< 8) /* Illegal coverage: use default (8) */
2076 else if (val
> USHRT_MAX
)
2079 up
->pcflag
|= UDPLITE_SEND_CC
;
2082 /* The receiver specifies a minimum checksum coverage value. To make
2083 * sense, this should be set to at least 8 (as done below). If zero is
2084 * used, this again means full checksum coverage. */
2085 case UDPLITE_RECV_CSCOV
:
2086 if (!is_udplite
) /* Disable the option on UDP sockets */
2087 return -ENOPROTOOPT
;
2088 if (val
!= 0 && val
< 8) /* Avoid silly minimal values. */
2090 else if (val
> USHRT_MAX
)
2093 up
->pcflag
|= UDPLITE_RECV_CC
;
2103 EXPORT_SYMBOL(udp_lib_setsockopt
);
2105 int udp_setsockopt(struct sock
*sk
, int level
, int optname
,
2106 char __user
*optval
, unsigned int optlen
)
2108 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2109 return udp_lib_setsockopt(sk
, level
, optname
, optval
, optlen
,
2110 udp_push_pending_frames
);
2111 return ip_setsockopt(sk
, level
, optname
, optval
, optlen
);
2114 #ifdef CONFIG_COMPAT
2115 int compat_udp_setsockopt(struct sock
*sk
, int level
, int optname
,
2116 char __user
*optval
, unsigned int optlen
)
2118 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2119 return udp_lib_setsockopt(sk
, level
, optname
, optval
, optlen
,
2120 udp_push_pending_frames
);
2121 return compat_ip_setsockopt(sk
, level
, optname
, optval
, optlen
);
2125 int udp_lib_getsockopt(struct sock
*sk
, int level
, int optname
,
2126 char __user
*optval
, int __user
*optlen
)
2128 struct udp_sock
*up
= udp_sk(sk
);
2131 if (get_user(len
, optlen
))
2134 len
= min_t(unsigned int, len
, sizeof(int));
2145 val
= up
->encap_type
;
2148 case UDP_NO_CHECK6_TX
:
2149 val
= up
->no_check6_tx
;
2152 case UDP_NO_CHECK6_RX
:
2153 val
= up
->no_check6_rx
;
2156 /* The following two cannot be changed on UDP sockets, the return is
2157 * always 0 (which corresponds to the full checksum coverage of UDP). */
2158 case UDPLITE_SEND_CSCOV
:
2162 case UDPLITE_RECV_CSCOV
:
2167 return -ENOPROTOOPT
;
2170 if (put_user(len
, optlen
))
2172 if (copy_to_user(optval
, &val
, len
))
2176 EXPORT_SYMBOL(udp_lib_getsockopt
);
2178 int udp_getsockopt(struct sock
*sk
, int level
, int optname
,
2179 char __user
*optval
, int __user
*optlen
)
2181 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2182 return udp_lib_getsockopt(sk
, level
, optname
, optval
, optlen
);
2183 return ip_getsockopt(sk
, level
, optname
, optval
, optlen
);
2186 #ifdef CONFIG_COMPAT
2187 int compat_udp_getsockopt(struct sock
*sk
, int level
, int optname
,
2188 char __user
*optval
, int __user
*optlen
)
2190 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2191 return udp_lib_getsockopt(sk
, level
, optname
, optval
, optlen
);
2192 return compat_ip_getsockopt(sk
, level
, optname
, optval
, optlen
);
2196 * udp_poll - wait for a UDP event.
2197 * @file - file struct
2199 * @wait - poll table
2201 * This is same as datagram poll, except for the special case of
2202 * blocking sockets. If application is using a blocking fd
2203 * and a packet with checksum error is in the queue;
2204 * then it could get return from select indicating data available
2205 * but then block when reading it. Add special case code
2206 * to work around these arguably broken applications.
2208 unsigned int udp_poll(struct file
*file
, struct socket
*sock
, poll_table
*wait
)
2210 unsigned int mask
= datagram_poll(file
, sock
, wait
);
2211 struct sock
*sk
= sock
->sk
;
2213 sock_rps_record_flow(sk
);
2215 /* Check for false positives due to checksum errors */
2216 if ((mask
& POLLRDNORM
) && !(file
->f_flags
& O_NONBLOCK
) &&
2217 !(sk
->sk_shutdown
& RCV_SHUTDOWN
) && !first_packet_length(sk
))
2218 mask
&= ~(POLLIN
| POLLRDNORM
);
2223 EXPORT_SYMBOL(udp_poll
);
2225 struct proto udp_prot
= {
2227 .owner
= THIS_MODULE
,
2228 .close
= udp_lib_close
,
2229 .connect
= ip4_datagram_connect
,
2230 .disconnect
= udp_disconnect
,
2232 .destroy
= udp_destroy_sock
,
2233 .setsockopt
= udp_setsockopt
,
2234 .getsockopt
= udp_getsockopt
,
2235 .sendmsg
= udp_sendmsg
,
2236 .recvmsg
= udp_recvmsg
,
2237 .sendpage
= udp_sendpage
,
2238 .backlog_rcv
= __udp_queue_rcv_skb
,
2239 .release_cb
= ip4_datagram_release_cb
,
2240 .hash
= udp_lib_hash
,
2241 .unhash
= udp_lib_unhash
,
2242 .rehash
= udp_v4_rehash
,
2243 .get_port
= udp_v4_get_port
,
2244 .memory_allocated
= &udp_memory_allocated
,
2245 .sysctl_mem
= sysctl_udp_mem
,
2246 .sysctl_wmem
= &sysctl_udp_wmem_min
,
2247 .sysctl_rmem
= &sysctl_udp_rmem_min
,
2248 .obj_size
= sizeof(struct udp_sock
),
2249 .slab_flags
= SLAB_DESTROY_BY_RCU
,
2250 .h
.udp_table
= &udp_table
,
2251 #ifdef CONFIG_COMPAT
2252 .compat_setsockopt
= compat_udp_setsockopt
,
2253 .compat_getsockopt
= compat_udp_getsockopt
,
2255 .clear_sk
= sk_prot_clear_portaddr_nulls
,
2257 EXPORT_SYMBOL(udp_prot
);
2259 /* ------------------------------------------------------------------------ */
2260 #ifdef CONFIG_PROC_FS
2262 static struct sock
*udp_get_first(struct seq_file
*seq
, int start
)
2265 struct udp_iter_state
*state
= seq
->private;
2266 struct net
*net
= seq_file_net(seq
);
2268 for (state
->bucket
= start
; state
->bucket
<= state
->udp_table
->mask
;
2270 struct hlist_nulls_node
*node
;
2271 struct udp_hslot
*hslot
= &state
->udp_table
->hash
[state
->bucket
];
2273 if (hlist_nulls_empty(&hslot
->head
))
2276 spin_lock_bh(&hslot
->lock
);
2277 sk_nulls_for_each(sk
, node
, &hslot
->head
) {
2278 if (!net_eq(sock_net(sk
), net
))
2280 if (sk
->sk_family
== state
->family
)
2283 spin_unlock_bh(&hslot
->lock
);
2290 static struct sock
*udp_get_next(struct seq_file
*seq
, struct sock
*sk
)
2292 struct udp_iter_state
*state
= seq
->private;
2293 struct net
*net
= seq_file_net(seq
);
2296 sk
= sk_nulls_next(sk
);
2297 } while (sk
&& (!net_eq(sock_net(sk
), net
) || sk
->sk_family
!= state
->family
));
2300 if (state
->bucket
<= state
->udp_table
->mask
)
2301 spin_unlock_bh(&state
->udp_table
->hash
[state
->bucket
].lock
);
2302 return udp_get_first(seq
, state
->bucket
+ 1);
2307 static struct sock
*udp_get_idx(struct seq_file
*seq
, loff_t pos
)
2309 struct sock
*sk
= udp_get_first(seq
, 0);
2312 while (pos
&& (sk
= udp_get_next(seq
, sk
)) != NULL
)
2314 return pos
? NULL
: sk
;
2317 static void *udp_seq_start(struct seq_file
*seq
, loff_t
*pos
)
2319 struct udp_iter_state
*state
= seq
->private;
2320 state
->bucket
= MAX_UDP_PORTS
;
2322 return *pos
? udp_get_idx(seq
, *pos
-1) : SEQ_START_TOKEN
;
2325 static void *udp_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
2329 if (v
== SEQ_START_TOKEN
)
2330 sk
= udp_get_idx(seq
, 0);
2332 sk
= udp_get_next(seq
, v
);
2338 static void udp_seq_stop(struct seq_file
*seq
, void *v
)
2340 struct udp_iter_state
*state
= seq
->private;
2342 if (state
->bucket
<= state
->udp_table
->mask
)
2343 spin_unlock_bh(&state
->udp_table
->hash
[state
->bucket
].lock
);
2346 int udp_seq_open(struct inode
*inode
, struct file
*file
)
2348 struct udp_seq_afinfo
*afinfo
= PDE_DATA(inode
);
2349 struct udp_iter_state
*s
;
2352 err
= seq_open_net(inode
, file
, &afinfo
->seq_ops
,
2353 sizeof(struct udp_iter_state
));
2357 s
= ((struct seq_file
*)file
->private_data
)->private;
2358 s
->family
= afinfo
->family
;
2359 s
->udp_table
= afinfo
->udp_table
;
2362 EXPORT_SYMBOL(udp_seq_open
);
2364 /* ------------------------------------------------------------------------ */
2365 int udp_proc_register(struct net
*net
, struct udp_seq_afinfo
*afinfo
)
2367 struct proc_dir_entry
*p
;
2370 afinfo
->seq_ops
.start
= udp_seq_start
;
2371 afinfo
->seq_ops
.next
= udp_seq_next
;
2372 afinfo
->seq_ops
.stop
= udp_seq_stop
;
2374 p
= proc_create_data(afinfo
->name
, S_IRUGO
, net
->proc_net
,
2375 afinfo
->seq_fops
, afinfo
);
2380 EXPORT_SYMBOL(udp_proc_register
);
2382 void udp_proc_unregister(struct net
*net
, struct udp_seq_afinfo
*afinfo
)
2384 remove_proc_entry(afinfo
->name
, net
->proc_net
);
2386 EXPORT_SYMBOL(udp_proc_unregister
);
2388 /* ------------------------------------------------------------------------ */
2389 static void udp4_format_sock(struct sock
*sp
, struct seq_file
*f
,
2392 struct inet_sock
*inet
= inet_sk(sp
);
2393 __be32 dest
= inet
->inet_daddr
;
2394 __be32 src
= inet
->inet_rcv_saddr
;
2395 __u16 destp
= ntohs(inet
->inet_dport
);
2396 __u16 srcp
= ntohs(inet
->inet_sport
);
2398 seq_printf(f
, "%5d: %08X:%04X %08X:%04X"
2399 " %02X %08X:%08X %02X:%08lX %08X %5u %8d %lu %d %pK %d",
2400 bucket
, src
, srcp
, dest
, destp
, sp
->sk_state
,
2401 sk_wmem_alloc_get(sp
),
2402 sk_rmem_alloc_get(sp
),
2404 from_kuid_munged(seq_user_ns(f
), sock_i_uid(sp
)),
2406 atomic_read(&sp
->sk_refcnt
), sp
,
2407 atomic_read(&sp
->sk_drops
));
2410 int udp4_seq_show(struct seq_file
*seq
, void *v
)
2412 seq_setwidth(seq
, 127);
2413 if (v
== SEQ_START_TOKEN
)
2414 seq_puts(seq
, " sl local_address rem_address st tx_queue "
2415 "rx_queue tr tm->when retrnsmt uid timeout "
2416 "inode ref pointer drops");
2418 struct udp_iter_state
*state
= seq
->private;
2420 udp4_format_sock(v
, seq
, state
->bucket
);
2426 static const struct file_operations udp_afinfo_seq_fops
= {
2427 .owner
= THIS_MODULE
,
2428 .open
= udp_seq_open
,
2430 .llseek
= seq_lseek
,
2431 .release
= seq_release_net
2434 /* ------------------------------------------------------------------------ */
2435 static struct udp_seq_afinfo udp4_seq_afinfo
= {
2438 .udp_table
= &udp_table
,
2439 .seq_fops
= &udp_afinfo_seq_fops
,
2441 .show
= udp4_seq_show
,
2445 static int __net_init
udp4_proc_init_net(struct net
*net
)
2447 return udp_proc_register(net
, &udp4_seq_afinfo
);
2450 static void __net_exit
udp4_proc_exit_net(struct net
*net
)
2452 udp_proc_unregister(net
, &udp4_seq_afinfo
);
2455 static struct pernet_operations udp4_net_ops
= {
2456 .init
= udp4_proc_init_net
,
2457 .exit
= udp4_proc_exit_net
,
2460 int __init
udp4_proc_init(void)
2462 return register_pernet_subsys(&udp4_net_ops
);
2465 void udp4_proc_exit(void)
2467 unregister_pernet_subsys(&udp4_net_ops
);
2469 #endif /* CONFIG_PROC_FS */
2471 static __initdata
unsigned long uhash_entries
;
2472 static int __init
set_uhash_entries(char *str
)
2479 ret
= kstrtoul(str
, 0, &uhash_entries
);
2483 if (uhash_entries
&& uhash_entries
< UDP_HTABLE_SIZE_MIN
)
2484 uhash_entries
= UDP_HTABLE_SIZE_MIN
;
2487 __setup("uhash_entries=", set_uhash_entries
);
2489 void __init
udp_table_init(struct udp_table
*table
, const char *name
)
2493 table
->hash
= alloc_large_system_hash(name
,
2494 2 * sizeof(struct udp_hslot
),
2496 21, /* one slot per 2 MB */
2500 UDP_HTABLE_SIZE_MIN
,
2503 table
->hash2
= table
->hash
+ (table
->mask
+ 1);
2504 for (i
= 0; i
<= table
->mask
; i
++) {
2505 INIT_HLIST_NULLS_HEAD(&table
->hash
[i
].head
, i
);
2506 table
->hash
[i
].count
= 0;
2507 spin_lock_init(&table
->hash
[i
].lock
);
2509 for (i
= 0; i
<= table
->mask
; i
++) {
2510 INIT_HLIST_NULLS_HEAD(&table
->hash2
[i
].head
, i
);
2511 table
->hash2
[i
].count
= 0;
2512 spin_lock_init(&table
->hash2
[i
].lock
);
2516 void __init
udp_init(void)
2518 unsigned long limit
;
2520 udp_table_init(&udp_table
, "UDP");
2521 limit
= nr_free_buffer_pages() / 8;
2522 limit
= max(limit
, 128UL);
2523 sysctl_udp_mem
[0] = limit
/ 4 * 3;
2524 sysctl_udp_mem
[1] = limit
;
2525 sysctl_udp_mem
[2] = sysctl_udp_mem
[0] * 2;
2527 sysctl_udp_rmem_min
= SK_MEM_QUANTUM
;
2528 sysctl_udp_wmem_min
= SK_MEM_QUANTUM
;