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
,
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
)
382 * In this second variant, we check (daddr, dport) matches (inet_rcv_sadd, inet_num)
384 static inline int compute_score2(struct sock
*sk
, struct net
*net
,
385 __be32 saddr
, __be16 sport
,
386 __be32 daddr
, unsigned int hnum
, int dif
)
389 struct inet_sock
*inet
;
391 if (!net_eq(sock_net(sk
), net
) ||
397 if (inet
->inet_rcv_saddr
!= daddr
||
398 inet
->inet_num
!= hnum
)
401 score
= (sk
->sk_family
== PF_INET
) ? 2 : 1;
403 if (inet
->inet_daddr
) {
404 if (inet
->inet_daddr
!= saddr
)
409 if (inet
->inet_dport
) {
410 if (inet
->inet_dport
!= sport
)
415 if (sk
->sk_bound_dev_if
) {
416 if (sk
->sk_bound_dev_if
!= dif
)
424 static unsigned int udp_ehashfn(struct net
*net
, const __be32 laddr
,
425 const __u16 lport
, const __be32 faddr
,
428 static u32 udp_ehash_secret __read_mostly
;
430 net_get_random_once(&udp_ehash_secret
, sizeof(udp_ehash_secret
));
432 return __inet_ehashfn(laddr
, lport
, faddr
, fport
,
433 udp_ehash_secret
+ net_hash_mix(net
));
437 /* called with read_rcu_lock() */
438 static struct sock
*udp4_lib_lookup2(struct net
*net
,
439 __be32 saddr
, __be16 sport
,
440 __be32 daddr
, unsigned int hnum
, int dif
,
441 struct udp_hslot
*hslot2
, unsigned int slot2
)
443 struct sock
*sk
, *result
;
444 struct hlist_nulls_node
*node
;
445 int score
, badness
, matches
= 0, reuseport
= 0;
451 udp_portaddr_for_each_entry_rcu(sk
, node
, &hslot2
->head
) {
452 score
= compute_score2(sk
, net
, saddr
, sport
,
454 if (score
> badness
) {
457 reuseport
= sk
->sk_reuseport
;
459 hash
= udp_ehashfn(net
, daddr
, hnum
,
463 } else if (score
== badness
&& reuseport
) {
465 if (reciprocal_scale(hash
, matches
) == 0)
467 hash
= next_pseudo_random32(hash
);
471 * if the nulls value we got at the end of this lookup is
472 * not the expected one, we must restart lookup.
473 * We probably met an item that was moved to another chain.
475 if (get_nulls_value(node
) != slot2
)
478 if (unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
480 else if (unlikely(compute_score2(result
, net
, saddr
, sport
,
481 daddr
, hnum
, dif
) < badness
)) {
489 /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
490 * harder than this. -DaveM
492 struct sock
*__udp4_lib_lookup(struct net
*net
, __be32 saddr
,
493 __be16 sport
, __be32 daddr
, __be16 dport
,
494 int dif
, struct udp_table
*udptable
)
496 struct sock
*sk
, *result
;
497 struct hlist_nulls_node
*node
;
498 unsigned short hnum
= ntohs(dport
);
499 unsigned int hash2
, slot2
, slot
= udp_hashfn(net
, hnum
, udptable
->mask
);
500 struct udp_hslot
*hslot2
, *hslot
= &udptable
->hash
[slot
];
501 int score
, badness
, matches
= 0, reuseport
= 0;
505 if (hslot
->count
> 10) {
506 hash2
= udp4_portaddr_hash(net
, daddr
, hnum
);
507 slot2
= hash2
& udptable
->mask
;
508 hslot2
= &udptable
->hash2
[slot2
];
509 if (hslot
->count
< hslot2
->count
)
512 result
= udp4_lib_lookup2(net
, saddr
, sport
,
516 hash2
= udp4_portaddr_hash(net
, htonl(INADDR_ANY
), hnum
);
517 slot2
= hash2
& udptable
->mask
;
518 hslot2
= &udptable
->hash2
[slot2
];
519 if (hslot
->count
< hslot2
->count
)
522 result
= udp4_lib_lookup2(net
, saddr
, sport
,
523 htonl(INADDR_ANY
), hnum
, dif
,
532 sk_nulls_for_each_rcu(sk
, node
, &hslot
->head
) {
533 score
= compute_score(sk
, net
, saddr
, hnum
, sport
,
535 if (score
> badness
) {
538 reuseport
= sk
->sk_reuseport
;
540 hash
= udp_ehashfn(net
, daddr
, hnum
,
544 } else if (score
== badness
&& reuseport
) {
546 if (reciprocal_scale(hash
, matches
) == 0)
548 hash
= next_pseudo_random32(hash
);
552 * if the nulls value we got at the end of this lookup is
553 * not the expected one, we must restart lookup.
554 * We probably met an item that was moved to another chain.
556 if (get_nulls_value(node
) != slot
)
560 if (unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
562 else if (unlikely(compute_score(result
, net
, saddr
, hnum
, sport
,
563 daddr
, dport
, dif
) < badness
)) {
571 EXPORT_SYMBOL_GPL(__udp4_lib_lookup
);
573 static inline struct sock
*__udp4_lib_lookup_skb(struct sk_buff
*skb
,
574 __be16 sport
, __be16 dport
,
575 struct udp_table
*udptable
)
577 const struct iphdr
*iph
= ip_hdr(skb
);
579 return __udp4_lib_lookup(dev_net(skb_dst(skb
)->dev
), iph
->saddr
, sport
,
580 iph
->daddr
, dport
, inet_iif(skb
),
584 struct sock
*udp4_lib_lookup(struct net
*net
, __be32 saddr
, __be16 sport
,
585 __be32 daddr
, __be16 dport
, int dif
)
587 return __udp4_lib_lookup(net
, saddr
, sport
, daddr
, dport
, dif
, &udp_table
);
589 EXPORT_SYMBOL_GPL(udp4_lib_lookup
);
591 static inline bool __udp_is_mcast_sock(struct net
*net
, struct sock
*sk
,
592 __be16 loc_port
, __be32 loc_addr
,
593 __be16 rmt_port
, __be32 rmt_addr
,
594 int dif
, unsigned short hnum
)
596 struct inet_sock
*inet
= inet_sk(sk
);
598 if (!net_eq(sock_net(sk
), net
) ||
599 udp_sk(sk
)->udp_port_hash
!= hnum
||
600 (inet
->inet_daddr
&& inet
->inet_daddr
!= rmt_addr
) ||
601 (inet
->inet_dport
!= rmt_port
&& inet
->inet_dport
) ||
602 (inet
->inet_rcv_saddr
&& inet
->inet_rcv_saddr
!= loc_addr
) ||
603 ipv6_only_sock(sk
) ||
604 (sk
->sk_bound_dev_if
&& sk
->sk_bound_dev_if
!= dif
))
606 if (!ip_mc_sf_allow(sk
, loc_addr
, rmt_addr
, dif
))
612 * This routine is called by the ICMP module when it gets some
613 * sort of error condition. If err < 0 then the socket should
614 * be closed and the error returned to the user. If err > 0
615 * it's just the icmp type << 8 | icmp code.
616 * Header points to the ip header of the error packet. We move
617 * on past this. Then (as it used to claim before adjustment)
618 * header points to the first 8 bytes of the udp header. We need
619 * to find the appropriate port.
622 void __udp4_lib_err(struct sk_buff
*skb
, u32 info
, struct udp_table
*udptable
)
624 struct inet_sock
*inet
;
625 const struct iphdr
*iph
= (const struct iphdr
*)skb
->data
;
626 struct udphdr
*uh
= (struct udphdr
*)(skb
->data
+(iph
->ihl
<<2));
627 const int type
= icmp_hdr(skb
)->type
;
628 const int code
= icmp_hdr(skb
)->code
;
632 struct net
*net
= dev_net(skb
->dev
);
634 sk
= __udp4_lib_lookup(net
, iph
->daddr
, uh
->dest
,
635 iph
->saddr
, uh
->source
, skb
->dev
->ifindex
, udptable
);
637 ICMP_INC_STATS_BH(net
, ICMP_MIB_INERRORS
);
638 return; /* No socket for error */
647 case ICMP_TIME_EXCEEDED
:
650 case ICMP_SOURCE_QUENCH
:
652 case ICMP_PARAMETERPROB
:
656 case ICMP_DEST_UNREACH
:
657 if (code
== ICMP_FRAG_NEEDED
) { /* Path MTU discovery */
658 ipv4_sk_update_pmtu(skb
, sk
, info
);
659 if (inet
->pmtudisc
!= IP_PMTUDISC_DONT
) {
667 if (code
<= NR_ICMP_UNREACH
) {
668 harderr
= icmp_err_convert
[code
].fatal
;
669 err
= icmp_err_convert
[code
].errno
;
673 ipv4_sk_redirect(skb
, sk
);
678 * RFC1122: OK. Passes ICMP errors back to application, as per
681 if (!inet
->recverr
) {
682 if (!harderr
|| sk
->sk_state
!= TCP_ESTABLISHED
)
685 ip_icmp_error(sk
, skb
, err
, uh
->dest
, info
, (u8
*)(uh
+1));
688 sk
->sk_error_report(sk
);
693 void udp_err(struct sk_buff
*skb
, u32 info
)
695 __udp4_lib_err(skb
, info
, &udp_table
);
699 * Throw away all pending data and cancel the corking. Socket is locked.
701 void udp_flush_pending_frames(struct sock
*sk
)
703 struct udp_sock
*up
= udp_sk(sk
);
708 ip_flush_pending_frames(sk
);
711 EXPORT_SYMBOL(udp_flush_pending_frames
);
714 * udp4_hwcsum - handle outgoing HW checksumming
715 * @skb: sk_buff containing the filled-in UDP header
716 * (checksum field must be zeroed out)
717 * @src: source IP address
718 * @dst: destination IP address
720 void udp4_hwcsum(struct sk_buff
*skb
, __be32 src
, __be32 dst
)
722 struct udphdr
*uh
= udp_hdr(skb
);
723 int offset
= skb_transport_offset(skb
);
724 int len
= skb
->len
- offset
;
728 if (!skb_has_frag_list(skb
)) {
730 * Only one fragment on the socket.
732 skb
->csum_start
= skb_transport_header(skb
) - skb
->head
;
733 skb
->csum_offset
= offsetof(struct udphdr
, check
);
734 uh
->check
= ~csum_tcpudp_magic(src
, dst
, len
,
737 struct sk_buff
*frags
;
740 * HW-checksum won't work as there are two or more
741 * fragments on the socket so that all csums of sk_buffs
744 skb_walk_frags(skb
, frags
) {
745 csum
= csum_add(csum
, frags
->csum
);
749 csum
= skb_checksum(skb
, offset
, hlen
, csum
);
750 skb
->ip_summed
= CHECKSUM_NONE
;
752 uh
->check
= csum_tcpudp_magic(src
, dst
, len
, IPPROTO_UDP
, csum
);
754 uh
->check
= CSUM_MANGLED_0
;
757 EXPORT_SYMBOL_GPL(udp4_hwcsum
);
759 /* Function to set UDP checksum for an IPv4 UDP packet. This is intended
760 * for the simple case like when setting the checksum for a UDP tunnel.
762 void udp_set_csum(bool nocheck
, struct sk_buff
*skb
,
763 __be32 saddr
, __be32 daddr
, int len
)
765 struct udphdr
*uh
= udp_hdr(skb
);
769 else if (skb_is_gso(skb
))
770 uh
->check
= ~udp_v4_check(len
, saddr
, daddr
, 0);
771 else if (skb_dst(skb
) && skb_dst(skb
)->dev
&&
772 (skb_dst(skb
)->dev
->features
& NETIF_F_V4_CSUM
)) {
774 BUG_ON(skb
->ip_summed
== CHECKSUM_PARTIAL
);
776 skb
->ip_summed
= CHECKSUM_PARTIAL
;
777 skb
->csum_start
= skb_transport_header(skb
) - skb
->head
;
778 skb
->csum_offset
= offsetof(struct udphdr
, check
);
779 uh
->check
= ~udp_v4_check(len
, saddr
, daddr
, 0);
783 BUG_ON(skb
->ip_summed
== CHECKSUM_PARTIAL
);
786 csum
= skb_checksum(skb
, 0, len
, 0);
787 uh
->check
= udp_v4_check(len
, saddr
, daddr
, csum
);
789 uh
->check
= CSUM_MANGLED_0
;
791 skb
->ip_summed
= CHECKSUM_UNNECESSARY
;
794 EXPORT_SYMBOL(udp_set_csum
);
796 static int udp_send_skb(struct sk_buff
*skb
, struct flowi4
*fl4
)
798 struct sock
*sk
= skb
->sk
;
799 struct inet_sock
*inet
= inet_sk(sk
);
802 int is_udplite
= IS_UDPLITE(sk
);
803 int offset
= skb_transport_offset(skb
);
804 int len
= skb
->len
- offset
;
808 * Create a UDP header
811 uh
->source
= inet
->inet_sport
;
812 uh
->dest
= fl4
->fl4_dport
;
813 uh
->len
= htons(len
);
816 if (is_udplite
) /* UDP-Lite */
817 csum
= udplite_csum(skb
);
819 else if (sk
->sk_no_check_tx
) { /* UDP csum disabled */
821 skb
->ip_summed
= CHECKSUM_NONE
;
824 } else if (skb
->ip_summed
== CHECKSUM_PARTIAL
) { /* UDP hardware csum */
826 udp4_hwcsum(skb
, fl4
->saddr
, fl4
->daddr
);
830 csum
= udp_csum(skb
);
832 /* add protocol-dependent pseudo-header */
833 uh
->check
= csum_tcpudp_magic(fl4
->saddr
, fl4
->daddr
, len
,
834 sk
->sk_protocol
, csum
);
836 uh
->check
= CSUM_MANGLED_0
;
839 err
= ip_send_skb(sock_net(sk
), skb
);
841 if (err
== -ENOBUFS
&& !inet
->recverr
) {
842 UDP_INC_STATS_USER(sock_net(sk
),
843 UDP_MIB_SNDBUFERRORS
, is_udplite
);
847 UDP_INC_STATS_USER(sock_net(sk
),
848 UDP_MIB_OUTDATAGRAMS
, is_udplite
);
853 * Push out all pending data as one UDP datagram. Socket is locked.
855 int udp_push_pending_frames(struct sock
*sk
)
857 struct udp_sock
*up
= udp_sk(sk
);
858 struct inet_sock
*inet
= inet_sk(sk
);
859 struct flowi4
*fl4
= &inet
->cork
.fl
.u
.ip4
;
863 skb
= ip_finish_skb(sk
, fl4
);
867 err
= udp_send_skb(skb
, fl4
);
874 EXPORT_SYMBOL(udp_push_pending_frames
);
876 int udp_sendmsg(struct kiocb
*iocb
, struct sock
*sk
, struct msghdr
*msg
,
879 struct inet_sock
*inet
= inet_sk(sk
);
880 struct udp_sock
*up
= udp_sk(sk
);
881 struct flowi4 fl4_stack
;
884 struct ipcm_cookie ipc
;
885 struct rtable
*rt
= NULL
;
888 __be32 daddr
, faddr
, saddr
;
891 int err
, is_udplite
= IS_UDPLITE(sk
);
892 int corkreq
= up
->corkflag
|| msg
->msg_flags
&MSG_MORE
;
893 int (*getfrag
)(void *, char *, int, int, int, struct sk_buff
*);
895 struct ip_options_data opt_copy
;
904 if (msg
->msg_flags
& MSG_OOB
) /* Mirror BSD error message compatibility */
912 getfrag
= is_udplite
? udplite_getfrag
: ip_generic_getfrag
;
914 fl4
= &inet
->cork
.fl
.u
.ip4
;
917 * There are pending frames.
918 * The socket lock must be held while it's corked.
921 if (likely(up
->pending
)) {
922 if (unlikely(up
->pending
!= AF_INET
)) {
930 ulen
+= sizeof(struct udphdr
);
933 * Get and verify the address.
936 DECLARE_SOCKADDR(struct sockaddr_in
*, usin
, msg
->msg_name
);
937 if (msg
->msg_namelen
< sizeof(*usin
))
939 if (usin
->sin_family
!= AF_INET
) {
940 if (usin
->sin_family
!= AF_UNSPEC
)
941 return -EAFNOSUPPORT
;
944 daddr
= usin
->sin_addr
.s_addr
;
945 dport
= usin
->sin_port
;
949 if (sk
->sk_state
!= TCP_ESTABLISHED
)
950 return -EDESTADDRREQ
;
951 daddr
= inet
->inet_daddr
;
952 dport
= inet
->inet_dport
;
953 /* Open fast path for connected socket.
954 Route will not be used, if at least one option is set.
958 ipc
.addr
= inet
->inet_saddr
;
960 ipc
.oif
= sk
->sk_bound_dev_if
;
962 sock_tx_timestamp(sk
, &ipc
.tx_flags
);
964 if (msg
->msg_controllen
) {
965 err
= ip_cmsg_send(sock_net(sk
), msg
, &ipc
,
966 sk
->sk_family
== AF_INET6
);
974 struct ip_options_rcu
*inet_opt
;
977 inet_opt
= rcu_dereference(inet
->inet_opt
);
979 memcpy(&opt_copy
, inet_opt
,
980 sizeof(*inet_opt
) + inet_opt
->opt
.optlen
);
981 ipc
.opt
= &opt_copy
.opt
;
987 ipc
.addr
= faddr
= daddr
;
989 if (ipc
.opt
&& ipc
.opt
->opt
.srr
) {
992 faddr
= ipc
.opt
->opt
.faddr
;
995 tos
= get_rttos(&ipc
, inet
);
996 if (sock_flag(sk
, SOCK_LOCALROUTE
) ||
997 (msg
->msg_flags
& MSG_DONTROUTE
) ||
998 (ipc
.opt
&& ipc
.opt
->opt
.is_strictroute
)) {
1003 if (ipv4_is_multicast(daddr
)) {
1005 ipc
.oif
= inet
->mc_index
;
1007 saddr
= inet
->mc_addr
;
1009 } else if (!ipc
.oif
)
1010 ipc
.oif
= inet
->uc_index
;
1013 rt
= (struct rtable
*)sk_dst_check(sk
, 0);
1016 struct net
*net
= sock_net(sk
);
1019 flowi4_init_output(fl4
, ipc
.oif
, sk
->sk_mark
, tos
,
1020 RT_SCOPE_UNIVERSE
, sk
->sk_protocol
,
1021 inet_sk_flowi_flags(sk
),
1022 faddr
, saddr
, dport
, inet
->inet_sport
);
1024 security_sk_classify_flow(sk
, flowi4_to_flowi(fl4
));
1025 rt
= ip_route_output_flow(net
, fl4
, sk
);
1029 if (err
== -ENETUNREACH
)
1030 IP_INC_STATS(net
, IPSTATS_MIB_OUTNOROUTES
);
1035 if ((rt
->rt_flags
& RTCF_BROADCAST
) &&
1036 !sock_flag(sk
, SOCK_BROADCAST
))
1039 sk_dst_set(sk
, dst_clone(&rt
->dst
));
1042 if (msg
->msg_flags
&MSG_CONFIRM
)
1048 daddr
= ipc
.addr
= fl4
->daddr
;
1050 /* Lockless fast path for the non-corking case. */
1052 skb
= ip_make_skb(sk
, fl4
, getfrag
, msg
, ulen
,
1053 sizeof(struct udphdr
), &ipc
, &rt
,
1056 if (!IS_ERR_OR_NULL(skb
))
1057 err
= udp_send_skb(skb
, fl4
);
1062 if (unlikely(up
->pending
)) {
1063 /* The socket is already corked while preparing it. */
1064 /* ... which is an evident application bug. --ANK */
1067 net_dbg_ratelimited("cork app bug 2\n");
1072 * Now cork the socket to pend data.
1074 fl4
= &inet
->cork
.fl
.u
.ip4
;
1077 fl4
->fl4_dport
= dport
;
1078 fl4
->fl4_sport
= inet
->inet_sport
;
1079 up
->pending
= AF_INET
;
1083 err
= ip_append_data(sk
, fl4
, getfrag
, msg
, ulen
,
1084 sizeof(struct udphdr
), &ipc
, &rt
,
1085 corkreq
? msg
->msg_flags
|MSG_MORE
: msg
->msg_flags
);
1087 udp_flush_pending_frames(sk
);
1089 err
= udp_push_pending_frames(sk
);
1090 else if (unlikely(skb_queue_empty(&sk
->sk_write_queue
)))
1101 * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
1102 * ENOBUFS might not be good (it's not tunable per se), but otherwise
1103 * we don't have a good statistic (IpOutDiscards but it can be too many
1104 * things). We could add another new stat but at least for now that
1105 * seems like overkill.
1107 if (err
== -ENOBUFS
|| test_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
)) {
1108 UDP_INC_STATS_USER(sock_net(sk
),
1109 UDP_MIB_SNDBUFERRORS
, is_udplite
);
1114 dst_confirm(&rt
->dst
);
1115 if (!(msg
->msg_flags
&MSG_PROBE
) || len
)
1116 goto back_from_confirm
;
1120 EXPORT_SYMBOL(udp_sendmsg
);
1122 int udp_sendpage(struct sock
*sk
, struct page
*page
, int offset
,
1123 size_t size
, int flags
)
1125 struct inet_sock
*inet
= inet_sk(sk
);
1126 struct udp_sock
*up
= udp_sk(sk
);
1129 if (flags
& MSG_SENDPAGE_NOTLAST
)
1133 struct msghdr msg
= { .msg_flags
= flags
|MSG_MORE
};
1135 /* Call udp_sendmsg to specify destination address which
1136 * sendpage interface can't pass.
1137 * This will succeed only when the socket is connected.
1139 ret
= udp_sendmsg(NULL
, sk
, &msg
, 0);
1146 if (unlikely(!up
->pending
)) {
1149 net_dbg_ratelimited("udp cork app bug 3\n");
1153 ret
= ip_append_page(sk
, &inet
->cork
.fl
.u
.ip4
,
1154 page
, offset
, size
, flags
);
1155 if (ret
== -EOPNOTSUPP
) {
1157 return sock_no_sendpage(sk
->sk_socket
, page
, offset
,
1161 udp_flush_pending_frames(sk
);
1166 if (!(up
->corkflag
|| (flags
&MSG_MORE
)))
1167 ret
= udp_push_pending_frames(sk
);
1177 * first_packet_length - return length of first packet in receive queue
1180 * Drops all bad checksum frames, until a valid one is found.
1181 * Returns the length of found skb, or 0 if none is found.
1183 static unsigned int first_packet_length(struct sock
*sk
)
1185 struct sk_buff_head list_kill
, *rcvq
= &sk
->sk_receive_queue
;
1186 struct sk_buff
*skb
;
1189 __skb_queue_head_init(&list_kill
);
1191 spin_lock_bh(&rcvq
->lock
);
1192 while ((skb
= skb_peek(rcvq
)) != NULL
&&
1193 udp_lib_checksum_complete(skb
)) {
1194 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_CSUMERRORS
,
1196 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
,
1198 atomic_inc(&sk
->sk_drops
);
1199 __skb_unlink(skb
, rcvq
);
1200 __skb_queue_tail(&list_kill
, skb
);
1202 res
= skb
? skb
->len
: 0;
1203 spin_unlock_bh(&rcvq
->lock
);
1205 if (!skb_queue_empty(&list_kill
)) {
1206 bool slow
= lock_sock_fast(sk
);
1208 __skb_queue_purge(&list_kill
);
1209 sk_mem_reclaim_partial(sk
);
1210 unlock_sock_fast(sk
, slow
);
1216 * IOCTL requests applicable to the UDP protocol
1219 int udp_ioctl(struct sock
*sk
, int cmd
, unsigned long arg
)
1224 int amount
= sk_wmem_alloc_get(sk
);
1226 return put_user(amount
, (int __user
*)arg
);
1231 unsigned int amount
= first_packet_length(sk
);
1235 * We will only return the amount
1236 * of this packet since that is all
1237 * that will be read.
1239 amount
-= sizeof(struct udphdr
);
1241 return put_user(amount
, (int __user
*)arg
);
1245 return -ENOIOCTLCMD
;
1250 EXPORT_SYMBOL(udp_ioctl
);
1253 * This should be easy, if there is something there we
1254 * return it, otherwise we block.
1257 int udp_recvmsg(struct kiocb
*iocb
, struct sock
*sk
, struct msghdr
*msg
,
1258 size_t len
, int noblock
, int flags
, int *addr_len
)
1260 struct inet_sock
*inet
= inet_sk(sk
);
1261 DECLARE_SOCKADDR(struct sockaddr_in
*, sin
, msg
->msg_name
);
1262 struct sk_buff
*skb
;
1263 unsigned int ulen
, copied
;
1264 int peeked
, off
= 0;
1266 int is_udplite
= IS_UDPLITE(sk
);
1269 if (flags
& MSG_ERRQUEUE
)
1270 return ip_recv_error(sk
, msg
, len
, addr_len
);
1273 skb
= __skb_recv_datagram(sk
, flags
| (noblock
? MSG_DONTWAIT
: 0),
1274 &peeked
, &off
, &err
);
1278 ulen
= skb
->len
- sizeof(struct udphdr
);
1282 else if (copied
< ulen
)
1283 msg
->msg_flags
|= MSG_TRUNC
;
1286 * If checksum is needed at all, try to do it while copying the
1287 * data. If the data is truncated, or if we only want a partial
1288 * coverage checksum (UDP-Lite), do it before the copy.
1291 if (copied
< ulen
|| UDP_SKB_CB(skb
)->partial_cov
) {
1292 if (udp_lib_checksum_complete(skb
))
1296 if (skb_csum_unnecessary(skb
))
1297 err
= skb_copy_datagram_msg(skb
, sizeof(struct udphdr
),
1300 err
= skb_copy_and_csum_datagram_msg(skb
, sizeof(struct udphdr
),
1307 if (unlikely(err
)) {
1308 trace_kfree_skb(skb
, udp_recvmsg
);
1310 atomic_inc(&sk
->sk_drops
);
1311 UDP_INC_STATS_USER(sock_net(sk
),
1312 UDP_MIB_INERRORS
, is_udplite
);
1318 UDP_INC_STATS_USER(sock_net(sk
),
1319 UDP_MIB_INDATAGRAMS
, is_udplite
);
1321 sock_recv_ts_and_drops(msg
, sk
, skb
);
1323 /* Copy the address. */
1325 sin
->sin_family
= AF_INET
;
1326 sin
->sin_port
= udp_hdr(skb
)->source
;
1327 sin
->sin_addr
.s_addr
= ip_hdr(skb
)->saddr
;
1328 memset(sin
->sin_zero
, 0, sizeof(sin
->sin_zero
));
1329 *addr_len
= sizeof(*sin
);
1331 if (inet
->cmsg_flags
)
1332 ip_cmsg_recv(msg
, skb
);
1335 if (flags
& MSG_TRUNC
)
1339 skb_free_datagram_locked(sk
, skb
);
1344 slow
= lock_sock_fast(sk
);
1345 if (!skb_kill_datagram(sk
, skb
, flags
)) {
1346 UDP_INC_STATS_USER(sock_net(sk
), UDP_MIB_CSUMERRORS
, is_udplite
);
1347 UDP_INC_STATS_USER(sock_net(sk
), UDP_MIB_INERRORS
, is_udplite
);
1349 unlock_sock_fast(sk
, slow
);
1354 /* starting over for a new packet */
1355 msg
->msg_flags
&= ~MSG_TRUNC
;
1360 int udp_disconnect(struct sock
*sk
, int flags
)
1362 struct inet_sock
*inet
= inet_sk(sk
);
1364 * 1003.1g - break association.
1367 sk
->sk_state
= TCP_CLOSE
;
1368 inet
->inet_daddr
= 0;
1369 inet
->inet_dport
= 0;
1370 sock_rps_reset_rxhash(sk
);
1371 sk
->sk_bound_dev_if
= 0;
1372 if (!(sk
->sk_userlocks
& SOCK_BINDADDR_LOCK
))
1373 inet_reset_saddr(sk
);
1375 if (!(sk
->sk_userlocks
& SOCK_BINDPORT_LOCK
)) {
1376 sk
->sk_prot
->unhash(sk
);
1377 inet
->inet_sport
= 0;
1382 EXPORT_SYMBOL(udp_disconnect
);
1384 void udp_lib_unhash(struct sock
*sk
)
1386 if (sk_hashed(sk
)) {
1387 struct udp_table
*udptable
= sk
->sk_prot
->h
.udp_table
;
1388 struct udp_hslot
*hslot
, *hslot2
;
1390 hslot
= udp_hashslot(udptable
, sock_net(sk
),
1391 udp_sk(sk
)->udp_port_hash
);
1392 hslot2
= udp_hashslot2(udptable
, udp_sk(sk
)->udp_portaddr_hash
);
1394 spin_lock_bh(&hslot
->lock
);
1395 if (sk_nulls_del_node_init_rcu(sk
)) {
1397 inet_sk(sk
)->inet_num
= 0;
1398 sock_prot_inuse_add(sock_net(sk
), sk
->sk_prot
, -1);
1400 spin_lock(&hslot2
->lock
);
1401 hlist_nulls_del_init_rcu(&udp_sk(sk
)->udp_portaddr_node
);
1403 spin_unlock(&hslot2
->lock
);
1405 spin_unlock_bh(&hslot
->lock
);
1408 EXPORT_SYMBOL(udp_lib_unhash
);
1411 * inet_rcv_saddr was changed, we must rehash secondary hash
1413 void udp_lib_rehash(struct sock
*sk
, u16 newhash
)
1415 if (sk_hashed(sk
)) {
1416 struct udp_table
*udptable
= sk
->sk_prot
->h
.udp_table
;
1417 struct udp_hslot
*hslot
, *hslot2
, *nhslot2
;
1419 hslot2
= udp_hashslot2(udptable
, udp_sk(sk
)->udp_portaddr_hash
);
1420 nhslot2
= udp_hashslot2(udptable
, newhash
);
1421 udp_sk(sk
)->udp_portaddr_hash
= newhash
;
1422 if (hslot2
!= nhslot2
) {
1423 hslot
= udp_hashslot(udptable
, sock_net(sk
),
1424 udp_sk(sk
)->udp_port_hash
);
1425 /* we must lock primary chain too */
1426 spin_lock_bh(&hslot
->lock
);
1428 spin_lock(&hslot2
->lock
);
1429 hlist_nulls_del_init_rcu(&udp_sk(sk
)->udp_portaddr_node
);
1431 spin_unlock(&hslot2
->lock
);
1433 spin_lock(&nhslot2
->lock
);
1434 hlist_nulls_add_head_rcu(&udp_sk(sk
)->udp_portaddr_node
,
1437 spin_unlock(&nhslot2
->lock
);
1439 spin_unlock_bh(&hslot
->lock
);
1443 EXPORT_SYMBOL(udp_lib_rehash
);
1445 static void udp_v4_rehash(struct sock
*sk
)
1447 u16 new_hash
= udp4_portaddr_hash(sock_net(sk
),
1448 inet_sk(sk
)->inet_rcv_saddr
,
1449 inet_sk(sk
)->inet_num
);
1450 udp_lib_rehash(sk
, new_hash
);
1453 static int __udp_queue_rcv_skb(struct sock
*sk
, struct sk_buff
*skb
)
1457 if (inet_sk(sk
)->inet_daddr
) {
1458 sock_rps_save_rxhash(sk
, skb
);
1459 sk_mark_napi_id(sk
, skb
);
1460 sk_incoming_cpu_update(sk
);
1463 rc
= sock_queue_rcv_skb(sk
, skb
);
1465 int is_udplite
= IS_UDPLITE(sk
);
1467 /* Note that an ENOMEM error is charged twice */
1469 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_RCVBUFERRORS
,
1471 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
, is_udplite
);
1473 trace_udp_fail_queue_rcv_skb(rc
, sk
);
1481 static struct static_key udp_encap_needed __read_mostly
;
1482 void udp_encap_enable(void)
1484 if (!static_key_enabled(&udp_encap_needed
))
1485 static_key_slow_inc(&udp_encap_needed
);
1487 EXPORT_SYMBOL(udp_encap_enable
);
1492 * >0: "udp encap" protocol resubmission
1494 * Note that in the success and error cases, the skb is assumed to
1495 * have either been requeued or freed.
1497 int udp_queue_rcv_skb(struct sock
*sk
, struct sk_buff
*skb
)
1499 struct udp_sock
*up
= udp_sk(sk
);
1501 int is_udplite
= IS_UDPLITE(sk
);
1504 * Charge it to the socket, dropping if the queue is full.
1506 if (!xfrm4_policy_check(sk
, XFRM_POLICY_IN
, skb
))
1510 if (static_key_false(&udp_encap_needed
) && up
->encap_type
) {
1511 int (*encap_rcv
)(struct sock
*sk
, struct sk_buff
*skb
);
1514 * This is an encapsulation socket so pass the skb to
1515 * the socket's udp_encap_rcv() hook. Otherwise, just
1516 * fall through and pass this up the UDP socket.
1517 * up->encap_rcv() returns the following value:
1518 * =0 if skb was successfully passed to the encap
1519 * handler or was discarded by it.
1520 * >0 if skb should be passed on to UDP.
1521 * <0 if skb should be resubmitted as proto -N
1524 /* if we're overly short, let UDP handle it */
1525 encap_rcv
= ACCESS_ONCE(up
->encap_rcv
);
1526 if (skb
->len
> sizeof(struct udphdr
) && encap_rcv
!= NULL
) {
1529 /* Verify checksum before giving to encap */
1530 if (udp_lib_checksum_complete(skb
))
1533 ret
= encap_rcv(sk
, skb
);
1535 UDP_INC_STATS_BH(sock_net(sk
),
1536 UDP_MIB_INDATAGRAMS
,
1542 /* FALLTHROUGH -- it's a UDP Packet */
1546 * UDP-Lite specific tests, ignored on UDP sockets
1548 if ((is_udplite
& UDPLITE_RECV_CC
) && UDP_SKB_CB(skb
)->partial_cov
) {
1551 * MIB statistics other than incrementing the error count are
1552 * disabled for the following two types of errors: these depend
1553 * on the application settings, not on the functioning of the
1554 * protocol stack as such.
1556 * RFC 3828 here recommends (sec 3.3): "There should also be a
1557 * way ... to ... at least let the receiving application block
1558 * delivery of packets with coverage values less than a value
1559 * provided by the application."
1561 if (up
->pcrlen
== 0) { /* full coverage was set */
1562 net_dbg_ratelimited("UDPLite: partial coverage %d while full coverage %d requested\n",
1563 UDP_SKB_CB(skb
)->cscov
, skb
->len
);
1566 /* The next case involves violating the min. coverage requested
1567 * by the receiver. This is subtle: if receiver wants x and x is
1568 * greater than the buffersize/MTU then receiver will complain
1569 * that it wants x while sender emits packets of smaller size y.
1570 * Therefore the above ...()->partial_cov statement is essential.
1572 if (UDP_SKB_CB(skb
)->cscov
< up
->pcrlen
) {
1573 net_dbg_ratelimited("UDPLite: coverage %d too small, need min %d\n",
1574 UDP_SKB_CB(skb
)->cscov
, up
->pcrlen
);
1579 if (rcu_access_pointer(sk
->sk_filter
) &&
1580 udp_lib_checksum_complete(skb
))
1584 if (sk_rcvqueues_full(sk
, sk
->sk_rcvbuf
)) {
1585 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_RCVBUFERRORS
,
1592 ipv4_pktinfo_prepare(sk
, skb
);
1594 if (!sock_owned_by_user(sk
))
1595 rc
= __udp_queue_rcv_skb(sk
, skb
);
1596 else if (sk_add_backlog(sk
, skb
, sk
->sk_rcvbuf
)) {
1605 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_CSUMERRORS
, is_udplite
);
1607 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
, is_udplite
);
1608 atomic_inc(&sk
->sk_drops
);
1614 static void flush_stack(struct sock
**stack
, unsigned int count
,
1615 struct sk_buff
*skb
, unsigned int final
)
1618 struct sk_buff
*skb1
= NULL
;
1621 for (i
= 0; i
< count
; i
++) {
1623 if (likely(skb1
== NULL
))
1624 skb1
= (i
== final
) ? skb
: skb_clone(skb
, GFP_ATOMIC
);
1627 atomic_inc(&sk
->sk_drops
);
1628 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_RCVBUFERRORS
,
1630 UDP_INC_STATS_BH(sock_net(sk
), UDP_MIB_INERRORS
,
1634 if (skb1
&& udp_queue_rcv_skb(sk
, skb1
) <= 0)
1643 /* For TCP sockets, sk_rx_dst is protected by socket lock
1644 * For UDP, we use xchg() to guard against concurrent changes.
1646 static void udp_sk_rx_dst_set(struct sock
*sk
, struct dst_entry
*dst
)
1648 struct dst_entry
*old
;
1651 old
= xchg(&sk
->sk_rx_dst
, dst
);
1656 * Multicasts and broadcasts go to each listener.
1658 * Note: called only from the BH handler context.
1660 static int __udp4_lib_mcast_deliver(struct net
*net
, struct sk_buff
*skb
,
1662 __be32 saddr
, __be32 daddr
,
1663 struct udp_table
*udptable
,
1666 struct sock
*sk
, *stack
[256 / sizeof(struct sock
*)];
1667 struct hlist_nulls_node
*node
;
1668 unsigned short hnum
= ntohs(uh
->dest
);
1669 struct udp_hslot
*hslot
= udp_hashslot(udptable
, net
, hnum
);
1670 int dif
= skb
->dev
->ifindex
;
1671 unsigned int count
= 0, offset
= offsetof(typeof(*sk
), sk_nulls_node
);
1672 unsigned int hash2
= 0, hash2_any
= 0, use_hash2
= (hslot
->count
> 10);
1673 bool inner_flushed
= false;
1676 hash2_any
= udp4_portaddr_hash(net
, htonl(INADDR_ANY
), hnum
) &
1678 hash2
= udp4_portaddr_hash(net
, daddr
, hnum
) & udp_table
.mask
;
1680 hslot
= &udp_table
.hash2
[hash2
];
1681 offset
= offsetof(typeof(*sk
), __sk_common
.skc_portaddr_node
);
1684 spin_lock(&hslot
->lock
);
1685 sk_nulls_for_each_entry_offset(sk
, node
, &hslot
->head
, offset
) {
1686 if (__udp_is_mcast_sock(net
, sk
,
1690 if (unlikely(count
== ARRAY_SIZE(stack
))) {
1691 flush_stack(stack
, count
, skb
, ~0);
1692 inner_flushed
= true;
1695 stack
[count
++] = sk
;
1700 spin_unlock(&hslot
->lock
);
1702 /* Also lookup *:port if we are using hash2 and haven't done so yet. */
1703 if (use_hash2
&& hash2
!= hash2_any
) {
1709 * do the slow work with no lock held
1712 flush_stack(stack
, count
, skb
, count
- 1);
1715 UDP_INC_STATS_BH(net
, UDP_MIB_IGNOREDMULTI
,
1716 proto
== IPPROTO_UDPLITE
);
1722 /* Initialize UDP checksum. If exited with zero value (success),
1723 * CHECKSUM_UNNECESSARY means, that no more checks are required.
1724 * Otherwise, csum completion requires chacksumming packet body,
1725 * including udp header and folding it to skb->csum.
1727 static inline int udp4_csum_init(struct sk_buff
*skb
, struct udphdr
*uh
,
1732 UDP_SKB_CB(skb
)->partial_cov
= 0;
1733 UDP_SKB_CB(skb
)->cscov
= skb
->len
;
1735 if (proto
== IPPROTO_UDPLITE
) {
1736 err
= udplite_checksum_init(skb
, uh
);
1741 return skb_checksum_init_zero_check(skb
, proto
, uh
->check
,
1742 inet_compute_pseudo
);
1746 * All we need to do is get the socket, and then do a checksum.
1749 int __udp4_lib_rcv(struct sk_buff
*skb
, struct udp_table
*udptable
,
1754 unsigned short ulen
;
1755 struct rtable
*rt
= skb_rtable(skb
);
1756 __be32 saddr
, daddr
;
1757 struct net
*net
= dev_net(skb
->dev
);
1760 * Validate the packet.
1762 if (!pskb_may_pull(skb
, sizeof(struct udphdr
)))
1763 goto drop
; /* No space for header. */
1766 ulen
= ntohs(uh
->len
);
1767 saddr
= ip_hdr(skb
)->saddr
;
1768 daddr
= ip_hdr(skb
)->daddr
;
1770 if (ulen
> skb
->len
)
1773 if (proto
== IPPROTO_UDP
) {
1774 /* UDP validates ulen. */
1775 if (ulen
< sizeof(*uh
) || pskb_trim_rcsum(skb
, ulen
))
1780 if (udp4_csum_init(skb
, uh
, proto
))
1783 sk
= skb_steal_sock(skb
);
1785 struct dst_entry
*dst
= skb_dst(skb
);
1788 if (unlikely(sk
->sk_rx_dst
!= dst
))
1789 udp_sk_rx_dst_set(sk
, dst
);
1791 ret
= udp_queue_rcv_skb(sk
, skb
);
1793 /* a return value > 0 means to resubmit the input, but
1794 * it wants the return to be -protocol, or 0
1801 if (rt
->rt_flags
& (RTCF_BROADCAST
|RTCF_MULTICAST
))
1802 return __udp4_lib_mcast_deliver(net
, skb
, uh
,
1803 saddr
, daddr
, udptable
, proto
);
1805 sk
= __udp4_lib_lookup_skb(skb
, uh
->source
, uh
->dest
, udptable
);
1809 if (udp_sk(sk
)->convert_csum
&& uh
->check
&& !IS_UDPLITE(sk
))
1810 skb_checksum_try_convert(skb
, IPPROTO_UDP
, uh
->check
,
1811 inet_compute_pseudo
);
1813 ret
= udp_queue_rcv_skb(sk
, skb
);
1816 /* a return value > 0 means to resubmit the input, but
1817 * it wants the return to be -protocol, or 0
1824 if (!xfrm4_policy_check(NULL
, XFRM_POLICY_IN
, skb
))
1828 /* No socket. Drop packet silently, if checksum is wrong */
1829 if (udp_lib_checksum_complete(skb
))
1832 UDP_INC_STATS_BH(net
, UDP_MIB_NOPORTS
, proto
== IPPROTO_UDPLITE
);
1833 icmp_send(skb
, ICMP_DEST_UNREACH
, ICMP_PORT_UNREACH
, 0);
1836 * Hmm. We got an UDP packet to a port to which we
1837 * don't wanna listen. Ignore it.
1843 net_dbg_ratelimited("UDP%s: short packet: From %pI4:%u %d/%d to %pI4:%u\n",
1844 proto
== IPPROTO_UDPLITE
? "Lite" : "",
1845 &saddr
, ntohs(uh
->source
),
1847 &daddr
, ntohs(uh
->dest
));
1852 * RFC1122: OK. Discards the bad packet silently (as far as
1853 * the network is concerned, anyway) as per 4.1.3.4 (MUST).
1855 net_dbg_ratelimited("UDP%s: bad checksum. From %pI4:%u to %pI4:%u ulen %d\n",
1856 proto
== IPPROTO_UDPLITE
? "Lite" : "",
1857 &saddr
, ntohs(uh
->source
), &daddr
, ntohs(uh
->dest
),
1859 UDP_INC_STATS_BH(net
, UDP_MIB_CSUMERRORS
, proto
== IPPROTO_UDPLITE
);
1861 UDP_INC_STATS_BH(net
, UDP_MIB_INERRORS
, proto
== IPPROTO_UDPLITE
);
1866 /* We can only early demux multicast if there is a single matching socket.
1867 * If more than one socket found returns NULL
1869 static struct sock
*__udp4_lib_mcast_demux_lookup(struct net
*net
,
1870 __be16 loc_port
, __be32 loc_addr
,
1871 __be16 rmt_port
, __be32 rmt_addr
,
1874 struct sock
*sk
, *result
;
1875 struct hlist_nulls_node
*node
;
1876 unsigned short hnum
= ntohs(loc_port
);
1877 unsigned int count
, slot
= udp_hashfn(net
, hnum
, udp_table
.mask
);
1878 struct udp_hslot
*hslot
= &udp_table
.hash
[slot
];
1880 /* Do not bother scanning a too big list */
1881 if (hslot
->count
> 10)
1888 sk_nulls_for_each_rcu(sk
, node
, &hslot
->head
) {
1889 if (__udp_is_mcast_sock(net
, sk
,
1898 * if the nulls value we got at the end of this lookup is
1899 * not the expected one, we must restart lookup.
1900 * We probably met an item that was moved to another chain.
1902 if (get_nulls_value(node
) != slot
)
1907 unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
1909 else if (unlikely(!__udp_is_mcast_sock(net
, result
,
1921 /* For unicast we should only early demux connected sockets or we can
1922 * break forwarding setups. The chains here can be long so only check
1923 * if the first socket is an exact match and if not move on.
1925 static struct sock
*__udp4_lib_demux_lookup(struct net
*net
,
1926 __be16 loc_port
, __be32 loc_addr
,
1927 __be16 rmt_port
, __be32 rmt_addr
,
1930 struct sock
*sk
, *result
;
1931 struct hlist_nulls_node
*node
;
1932 unsigned short hnum
= ntohs(loc_port
);
1933 unsigned int hash2
= udp4_portaddr_hash(net
, loc_addr
, hnum
);
1934 unsigned int slot2
= hash2
& udp_table
.mask
;
1935 struct udp_hslot
*hslot2
= &udp_table
.hash2
[slot2
];
1936 INET_ADDR_COOKIE(acookie
, rmt_addr
, loc_addr
);
1937 const __portpair ports
= INET_COMBINED_PORTS(rmt_port
, hnum
);
1941 udp_portaddr_for_each_entry_rcu(sk
, node
, &hslot2
->head
) {
1942 if (INET_MATCH(sk
, net
, acookie
,
1943 rmt_addr
, loc_addr
, ports
, dif
))
1945 /* Only check first socket in chain */
1950 if (unlikely(!atomic_inc_not_zero_hint(&result
->sk_refcnt
, 2)))
1952 else if (unlikely(!INET_MATCH(sk
, net
, acookie
,
1963 void udp_v4_early_demux(struct sk_buff
*skb
)
1965 struct net
*net
= dev_net(skb
->dev
);
1966 const struct iphdr
*iph
;
1967 const struct udphdr
*uh
;
1969 struct dst_entry
*dst
;
1970 int dif
= skb
->dev
->ifindex
;
1972 /* validate the packet */
1973 if (!pskb_may_pull(skb
, skb_transport_offset(skb
) + sizeof(struct udphdr
)))
1979 if (skb
->pkt_type
== PACKET_BROADCAST
||
1980 skb
->pkt_type
== PACKET_MULTICAST
)
1981 sk
= __udp4_lib_mcast_demux_lookup(net
, uh
->dest
, iph
->daddr
,
1982 uh
->source
, iph
->saddr
, dif
);
1983 else if (skb
->pkt_type
== PACKET_HOST
)
1984 sk
= __udp4_lib_demux_lookup(net
, uh
->dest
, iph
->daddr
,
1985 uh
->source
, iph
->saddr
, dif
);
1993 skb
->destructor
= sock_efree
;
1994 dst
= sk
->sk_rx_dst
;
1997 dst
= dst_check(dst
, 0);
1999 skb_dst_set_noref(skb
, dst
);
2002 int udp_rcv(struct sk_buff
*skb
)
2004 return __udp4_lib_rcv(skb
, &udp_table
, IPPROTO_UDP
);
2007 void udp_destroy_sock(struct sock
*sk
)
2009 struct udp_sock
*up
= udp_sk(sk
);
2010 bool slow
= lock_sock_fast(sk
);
2011 udp_flush_pending_frames(sk
);
2012 unlock_sock_fast(sk
, slow
);
2013 if (static_key_false(&udp_encap_needed
) && up
->encap_type
) {
2014 void (*encap_destroy
)(struct sock
*sk
);
2015 encap_destroy
= ACCESS_ONCE(up
->encap_destroy
);
2022 * Socket option code for UDP
2024 int udp_lib_setsockopt(struct sock
*sk
, int level
, int optname
,
2025 char __user
*optval
, unsigned int optlen
,
2026 int (*push_pending_frames
)(struct sock
*))
2028 struct udp_sock
*up
= udp_sk(sk
);
2031 int is_udplite
= IS_UDPLITE(sk
);
2033 if (optlen
< sizeof(int))
2036 if (get_user(val
, (int __user
*)optval
))
2039 valbool
= val
? 1 : 0;
2048 push_pending_frames(sk
);
2056 case UDP_ENCAP_ESPINUDP
:
2057 case UDP_ENCAP_ESPINUDP_NON_IKE
:
2058 up
->encap_rcv
= xfrm4_udp_encap_rcv
;
2060 case UDP_ENCAP_L2TPINUDP
:
2061 up
->encap_type
= val
;
2070 case UDP_NO_CHECK6_TX
:
2071 up
->no_check6_tx
= valbool
;
2074 case UDP_NO_CHECK6_RX
:
2075 up
->no_check6_rx
= valbool
;
2079 * UDP-Lite's partial checksum coverage (RFC 3828).
2081 /* The sender sets actual checksum coverage length via this option.
2082 * The case coverage > packet length is handled by send module. */
2083 case UDPLITE_SEND_CSCOV
:
2084 if (!is_udplite
) /* Disable the option on UDP sockets */
2085 return -ENOPROTOOPT
;
2086 if (val
!= 0 && val
< 8) /* Illegal coverage: use default (8) */
2088 else if (val
> USHRT_MAX
)
2091 up
->pcflag
|= UDPLITE_SEND_CC
;
2094 /* The receiver specifies a minimum checksum coverage value. To make
2095 * sense, this should be set to at least 8 (as done below). If zero is
2096 * used, this again means full checksum coverage. */
2097 case UDPLITE_RECV_CSCOV
:
2098 if (!is_udplite
) /* Disable the option on UDP sockets */
2099 return -ENOPROTOOPT
;
2100 if (val
!= 0 && val
< 8) /* Avoid silly minimal values. */
2102 else if (val
> USHRT_MAX
)
2105 up
->pcflag
|= UDPLITE_RECV_CC
;
2115 EXPORT_SYMBOL(udp_lib_setsockopt
);
2117 int udp_setsockopt(struct sock
*sk
, int level
, int optname
,
2118 char __user
*optval
, unsigned int optlen
)
2120 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2121 return udp_lib_setsockopt(sk
, level
, optname
, optval
, optlen
,
2122 udp_push_pending_frames
);
2123 return ip_setsockopt(sk
, level
, optname
, optval
, optlen
);
2126 #ifdef CONFIG_COMPAT
2127 int compat_udp_setsockopt(struct sock
*sk
, int level
, int optname
,
2128 char __user
*optval
, unsigned int optlen
)
2130 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2131 return udp_lib_setsockopt(sk
, level
, optname
, optval
, optlen
,
2132 udp_push_pending_frames
);
2133 return compat_ip_setsockopt(sk
, level
, optname
, optval
, optlen
);
2137 int udp_lib_getsockopt(struct sock
*sk
, int level
, int optname
,
2138 char __user
*optval
, int __user
*optlen
)
2140 struct udp_sock
*up
= udp_sk(sk
);
2143 if (get_user(len
, optlen
))
2146 len
= min_t(unsigned int, len
, sizeof(int));
2157 val
= up
->encap_type
;
2160 case UDP_NO_CHECK6_TX
:
2161 val
= up
->no_check6_tx
;
2164 case UDP_NO_CHECK6_RX
:
2165 val
= up
->no_check6_rx
;
2168 /* The following two cannot be changed on UDP sockets, the return is
2169 * always 0 (which corresponds to the full checksum coverage of UDP). */
2170 case UDPLITE_SEND_CSCOV
:
2174 case UDPLITE_RECV_CSCOV
:
2179 return -ENOPROTOOPT
;
2182 if (put_user(len
, optlen
))
2184 if (copy_to_user(optval
, &val
, len
))
2188 EXPORT_SYMBOL(udp_lib_getsockopt
);
2190 int udp_getsockopt(struct sock
*sk
, int level
, int optname
,
2191 char __user
*optval
, int __user
*optlen
)
2193 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2194 return udp_lib_getsockopt(sk
, level
, optname
, optval
, optlen
);
2195 return ip_getsockopt(sk
, level
, optname
, optval
, optlen
);
2198 #ifdef CONFIG_COMPAT
2199 int compat_udp_getsockopt(struct sock
*sk
, int level
, int optname
,
2200 char __user
*optval
, int __user
*optlen
)
2202 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
2203 return udp_lib_getsockopt(sk
, level
, optname
, optval
, optlen
);
2204 return compat_ip_getsockopt(sk
, level
, optname
, optval
, optlen
);
2208 * udp_poll - wait for a UDP event.
2209 * @file - file struct
2211 * @wait - poll table
2213 * This is same as datagram poll, except for the special case of
2214 * blocking sockets. If application is using a blocking fd
2215 * and a packet with checksum error is in the queue;
2216 * then it could get return from select indicating data available
2217 * but then block when reading it. Add special case code
2218 * to work around these arguably broken applications.
2220 unsigned int udp_poll(struct file
*file
, struct socket
*sock
, poll_table
*wait
)
2222 unsigned int mask
= datagram_poll(file
, sock
, wait
);
2223 struct sock
*sk
= sock
->sk
;
2225 sock_rps_record_flow(sk
);
2227 /* Check for false positives due to checksum errors */
2228 if ((mask
& POLLRDNORM
) && !(file
->f_flags
& O_NONBLOCK
) &&
2229 !(sk
->sk_shutdown
& RCV_SHUTDOWN
) && !first_packet_length(sk
))
2230 mask
&= ~(POLLIN
| POLLRDNORM
);
2235 EXPORT_SYMBOL(udp_poll
);
2237 struct proto udp_prot
= {
2239 .owner
= THIS_MODULE
,
2240 .close
= udp_lib_close
,
2241 .connect
= ip4_datagram_connect
,
2242 .disconnect
= udp_disconnect
,
2244 .destroy
= udp_destroy_sock
,
2245 .setsockopt
= udp_setsockopt
,
2246 .getsockopt
= udp_getsockopt
,
2247 .sendmsg
= udp_sendmsg
,
2248 .recvmsg
= udp_recvmsg
,
2249 .sendpage
= udp_sendpage
,
2250 .backlog_rcv
= __udp_queue_rcv_skb
,
2251 .release_cb
= ip4_datagram_release_cb
,
2252 .hash
= udp_lib_hash
,
2253 .unhash
= udp_lib_unhash
,
2254 .rehash
= udp_v4_rehash
,
2255 .get_port
= udp_v4_get_port
,
2256 .memory_allocated
= &udp_memory_allocated
,
2257 .sysctl_mem
= sysctl_udp_mem
,
2258 .sysctl_wmem
= &sysctl_udp_wmem_min
,
2259 .sysctl_rmem
= &sysctl_udp_rmem_min
,
2260 .obj_size
= sizeof(struct udp_sock
),
2261 .slab_flags
= SLAB_DESTROY_BY_RCU
,
2262 .h
.udp_table
= &udp_table
,
2263 #ifdef CONFIG_COMPAT
2264 .compat_setsockopt
= compat_udp_setsockopt
,
2265 .compat_getsockopt
= compat_udp_getsockopt
,
2267 .clear_sk
= sk_prot_clear_portaddr_nulls
,
2269 EXPORT_SYMBOL(udp_prot
);
2271 /* ------------------------------------------------------------------------ */
2272 #ifdef CONFIG_PROC_FS
2274 static struct sock
*udp_get_first(struct seq_file
*seq
, int start
)
2277 struct udp_iter_state
*state
= seq
->private;
2278 struct net
*net
= seq_file_net(seq
);
2280 for (state
->bucket
= start
; state
->bucket
<= state
->udp_table
->mask
;
2282 struct hlist_nulls_node
*node
;
2283 struct udp_hslot
*hslot
= &state
->udp_table
->hash
[state
->bucket
];
2285 if (hlist_nulls_empty(&hslot
->head
))
2288 spin_lock_bh(&hslot
->lock
);
2289 sk_nulls_for_each(sk
, node
, &hslot
->head
) {
2290 if (!net_eq(sock_net(sk
), net
))
2292 if (sk
->sk_family
== state
->family
)
2295 spin_unlock_bh(&hslot
->lock
);
2302 static struct sock
*udp_get_next(struct seq_file
*seq
, struct sock
*sk
)
2304 struct udp_iter_state
*state
= seq
->private;
2305 struct net
*net
= seq_file_net(seq
);
2308 sk
= sk_nulls_next(sk
);
2309 } while (sk
&& (!net_eq(sock_net(sk
), net
) || sk
->sk_family
!= state
->family
));
2312 if (state
->bucket
<= state
->udp_table
->mask
)
2313 spin_unlock_bh(&state
->udp_table
->hash
[state
->bucket
].lock
);
2314 return udp_get_first(seq
, state
->bucket
+ 1);
2319 static struct sock
*udp_get_idx(struct seq_file
*seq
, loff_t pos
)
2321 struct sock
*sk
= udp_get_first(seq
, 0);
2324 while (pos
&& (sk
= udp_get_next(seq
, sk
)) != NULL
)
2326 return pos
? NULL
: sk
;
2329 static void *udp_seq_start(struct seq_file
*seq
, loff_t
*pos
)
2331 struct udp_iter_state
*state
= seq
->private;
2332 state
->bucket
= MAX_UDP_PORTS
;
2334 return *pos
? udp_get_idx(seq
, *pos
-1) : SEQ_START_TOKEN
;
2337 static void *udp_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
2341 if (v
== SEQ_START_TOKEN
)
2342 sk
= udp_get_idx(seq
, 0);
2344 sk
= udp_get_next(seq
, v
);
2350 static void udp_seq_stop(struct seq_file
*seq
, void *v
)
2352 struct udp_iter_state
*state
= seq
->private;
2354 if (state
->bucket
<= state
->udp_table
->mask
)
2355 spin_unlock_bh(&state
->udp_table
->hash
[state
->bucket
].lock
);
2358 int udp_seq_open(struct inode
*inode
, struct file
*file
)
2360 struct udp_seq_afinfo
*afinfo
= PDE_DATA(inode
);
2361 struct udp_iter_state
*s
;
2364 err
= seq_open_net(inode
, file
, &afinfo
->seq_ops
,
2365 sizeof(struct udp_iter_state
));
2369 s
= ((struct seq_file
*)file
->private_data
)->private;
2370 s
->family
= afinfo
->family
;
2371 s
->udp_table
= afinfo
->udp_table
;
2374 EXPORT_SYMBOL(udp_seq_open
);
2376 /* ------------------------------------------------------------------------ */
2377 int udp_proc_register(struct net
*net
, struct udp_seq_afinfo
*afinfo
)
2379 struct proc_dir_entry
*p
;
2382 afinfo
->seq_ops
.start
= udp_seq_start
;
2383 afinfo
->seq_ops
.next
= udp_seq_next
;
2384 afinfo
->seq_ops
.stop
= udp_seq_stop
;
2386 p
= proc_create_data(afinfo
->name
, S_IRUGO
, net
->proc_net
,
2387 afinfo
->seq_fops
, afinfo
);
2392 EXPORT_SYMBOL(udp_proc_register
);
2394 void udp_proc_unregister(struct net
*net
, struct udp_seq_afinfo
*afinfo
)
2396 remove_proc_entry(afinfo
->name
, net
->proc_net
);
2398 EXPORT_SYMBOL(udp_proc_unregister
);
2400 /* ------------------------------------------------------------------------ */
2401 static void udp4_format_sock(struct sock
*sp
, struct seq_file
*f
,
2404 struct inet_sock
*inet
= inet_sk(sp
);
2405 __be32 dest
= inet
->inet_daddr
;
2406 __be32 src
= inet
->inet_rcv_saddr
;
2407 __u16 destp
= ntohs(inet
->inet_dport
);
2408 __u16 srcp
= ntohs(inet
->inet_sport
);
2410 seq_printf(f
, "%5d: %08X:%04X %08X:%04X"
2411 " %02X %08X:%08X %02X:%08lX %08X %5u %8d %lu %d %pK %d",
2412 bucket
, src
, srcp
, dest
, destp
, sp
->sk_state
,
2413 sk_wmem_alloc_get(sp
),
2414 sk_rmem_alloc_get(sp
),
2416 from_kuid_munged(seq_user_ns(f
), sock_i_uid(sp
)),
2418 atomic_read(&sp
->sk_refcnt
), sp
,
2419 atomic_read(&sp
->sk_drops
));
2422 int udp4_seq_show(struct seq_file
*seq
, void *v
)
2424 seq_setwidth(seq
, 127);
2425 if (v
== SEQ_START_TOKEN
)
2426 seq_puts(seq
, " sl local_address rem_address st tx_queue "
2427 "rx_queue tr tm->when retrnsmt uid timeout "
2428 "inode ref pointer drops");
2430 struct udp_iter_state
*state
= seq
->private;
2432 udp4_format_sock(v
, seq
, state
->bucket
);
2438 static const struct file_operations udp_afinfo_seq_fops
= {
2439 .owner
= THIS_MODULE
,
2440 .open
= udp_seq_open
,
2442 .llseek
= seq_lseek
,
2443 .release
= seq_release_net
2446 /* ------------------------------------------------------------------------ */
2447 static struct udp_seq_afinfo udp4_seq_afinfo
= {
2450 .udp_table
= &udp_table
,
2451 .seq_fops
= &udp_afinfo_seq_fops
,
2453 .show
= udp4_seq_show
,
2457 static int __net_init
udp4_proc_init_net(struct net
*net
)
2459 return udp_proc_register(net
, &udp4_seq_afinfo
);
2462 static void __net_exit
udp4_proc_exit_net(struct net
*net
)
2464 udp_proc_unregister(net
, &udp4_seq_afinfo
);
2467 static struct pernet_operations udp4_net_ops
= {
2468 .init
= udp4_proc_init_net
,
2469 .exit
= udp4_proc_exit_net
,
2472 int __init
udp4_proc_init(void)
2474 return register_pernet_subsys(&udp4_net_ops
);
2477 void udp4_proc_exit(void)
2479 unregister_pernet_subsys(&udp4_net_ops
);
2481 #endif /* CONFIG_PROC_FS */
2483 static __initdata
unsigned long uhash_entries
;
2484 static int __init
set_uhash_entries(char *str
)
2491 ret
= kstrtoul(str
, 0, &uhash_entries
);
2495 if (uhash_entries
&& uhash_entries
< UDP_HTABLE_SIZE_MIN
)
2496 uhash_entries
= UDP_HTABLE_SIZE_MIN
;
2499 __setup("uhash_entries=", set_uhash_entries
);
2501 void __init
udp_table_init(struct udp_table
*table
, const char *name
)
2505 table
->hash
= alloc_large_system_hash(name
,
2506 2 * sizeof(struct udp_hslot
),
2508 21, /* one slot per 2 MB */
2512 UDP_HTABLE_SIZE_MIN
,
2515 table
->hash2
= table
->hash
+ (table
->mask
+ 1);
2516 for (i
= 0; i
<= table
->mask
; i
++) {
2517 INIT_HLIST_NULLS_HEAD(&table
->hash
[i
].head
, i
);
2518 table
->hash
[i
].count
= 0;
2519 spin_lock_init(&table
->hash
[i
].lock
);
2521 for (i
= 0; i
<= table
->mask
; i
++) {
2522 INIT_HLIST_NULLS_HEAD(&table
->hash2
[i
].head
, i
);
2523 table
->hash2
[i
].count
= 0;
2524 spin_lock_init(&table
->hash2
[i
].lock
);
2528 void __init
udp_init(void)
2530 unsigned long limit
;
2532 udp_table_init(&udp_table
, "UDP");
2533 limit
= nr_free_buffer_pages() / 8;
2534 limit
= max(limit
, 128UL);
2535 sysctl_udp_mem
[0] = limit
/ 4 * 3;
2536 sysctl_udp_mem
[1] = limit
;
2537 sysctl_udp_mem
[2] = sysctl_udp_mem
[0] * 2;
2539 sysctl_udp_rmem_min
= SK_MEM_QUANTUM
;
2540 sysctl_udp_wmem_min
= SK_MEM_QUANTUM
;