2 * INET An implementation of the TCP/IP protocol suite for the LINUX
3 * operating system. INET is implemented using the BSD Socket
4 * interface as the means of communication with the user level.
6 * The User Datagram Protocol (UDP).
8 * Version: $Id: udp.c,v 1.102 2002/02/01 22:01:04 davem Exp $
11 * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
12 * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
13 * Alan Cox, <Alan.Cox@linux.org>
14 * Hirokazu Takahashi, <taka@valinux.co.jp>
17 * Alan Cox : verify_area() calls
18 * Alan Cox : stopped close while in use off icmp
19 * messages. Not a fix but a botch that
20 * for udp at least is 'valid'.
21 * Alan Cox : Fixed icmp handling properly
22 * Alan Cox : Correct error for oversized datagrams
23 * Alan Cox : Tidied select() semantics.
24 * Alan Cox : udp_err() fixed properly, also now
25 * select and read wake correctly on errors
26 * Alan Cox : udp_send verify_area moved to avoid mem leak
27 * Alan Cox : UDP can count its memory
28 * Alan Cox : send to an unknown connection causes
29 * an ECONNREFUSED off the icmp, but
31 * Alan Cox : Switched to new sk_buff handlers. No more backlog!
32 * Alan Cox : Using generic datagram code. Even smaller and the PEEK
33 * bug no longer crashes it.
34 * Fred Van Kempen : Net2e support for sk->broadcast.
35 * Alan Cox : Uses skb_free_datagram
36 * Alan Cox : Added get/set sockopt support.
37 * Alan Cox : Broadcasting without option set returns EACCES.
38 * Alan Cox : No wakeup calls. Instead we now use the callbacks.
39 * Alan Cox : Use ip_tos and ip_ttl
40 * Alan Cox : SNMP Mibs
41 * Alan Cox : MSG_DONTROUTE, and 0.0.0.0 support.
42 * Matt Dillon : UDP length checks.
43 * Alan Cox : Smarter af_inet used properly.
44 * Alan Cox : Use new kernel side addressing.
45 * Alan Cox : Incorrect return on truncated datagram receive.
46 * Arnt Gulbrandsen : New udp_send and stuff
47 * Alan Cox : Cache last socket
48 * Alan Cox : Route cache
49 * Jon Peatfield : Minor efficiency fix to sendto().
50 * Mike Shaver : RFC1122 checks.
51 * Alan Cox : Nonblocking error fix.
52 * Willy Konynenberg : Transparent proxying support.
53 * Mike McLagan : Routing by source
54 * David S. Miller : New socket lookup architecture.
55 * Last socket cache retained as it
56 * does have a high hit rate.
57 * Olaf Kirch : Don't linearise iovec on sendmsg.
58 * Andi Kleen : Some cleanups, cache destination entry
60 * Vitaly E. Lavrov : Transparent proxy revived after year coma.
61 * Melvin Smith : Check msg_name not msg_namelen in sendto(),
62 * return ENOTCONN for unconnected sockets (POSIX)
63 * Janos Farkas : don't deliver multi/broadcasts to a different
64 * bound-to-device socket
65 * Hirokazu Takahashi : HW checksumming for outgoing UDP
67 * Hirokazu Takahashi : sendfile() on UDP works now.
68 * Arnaldo C. Melo : convert /proc/net/udp to seq_file
69 * YOSHIFUJI Hideaki @USAGI and: Support IPV6_V6ONLY socket option, which
70 * Alexey Kuznetsov: allow both IPv4 and IPv6 sockets to bind
71 * a single port at the same time.
72 * Derek Atkins <derek@ihtfp.com>: Add Encapulation Support
73 * James Chapman : Add L2TP encapsulation type.
76 * This program is free software; you can redistribute it and/or
77 * modify it under the terms of the GNU General Public License
78 * as published by the Free Software Foundation; either version
79 * 2 of the License, or (at your option) any later version.
82 #include <asm/system.h>
83 #include <asm/uaccess.h>
84 #include <asm/ioctls.h>
85 #include <linux/types.h>
86 #include <linux/fcntl.h>
87 #include <linux/module.h>
88 #include <linux/socket.h>
89 #include <linux/sockios.h>
90 #include <linux/igmp.h>
92 #include <linux/errno.h>
93 #include <linux/timer.h>
95 #include <linux/inet.h>
96 #include <linux/netdevice.h>
97 #include <net/tcp_states.h>
98 #include <linux/skbuff.h>
99 #include <linux/proc_fs.h>
100 #include <linux/seq_file.h>
101 #include <net/icmp.h>
102 #include <net/route.h>
103 #include <net/checksum.h>
104 #include <net/xfrm.h>
105 #include "udp_impl.h"
108 * Snmp MIB for the UDP layer
111 DEFINE_SNMP_STAT(struct udp_mib
, udp_statistics
) __read_mostly
;
113 struct hlist_head udp_hash
[UDP_HTABLE_SIZE
];
114 DEFINE_RWLOCK(udp_hash_lock
);
116 static inline int __udp_lib_lport_inuse(__u16 num
,
117 const struct hlist_head udptable
[])
120 struct hlist_node
*node
;
122 sk_for_each(sk
, node
, &udptable
[num
& (UDP_HTABLE_SIZE
- 1)])
123 if (sk
->sk_hash
== num
)
129 * __udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
131 * @sk: socket struct in question
132 * @snum: port number to look up
133 * @udptable: hash list table, must be of UDP_HTABLE_SIZE
134 * @saddr_comp: AF-dependent comparison of bound local IP addresses
136 int __udp_lib_get_port(struct sock
*sk
, unsigned short snum
,
137 struct hlist_head udptable
[],
138 int (*saddr_comp
)(const struct sock
*sk1
,
139 const struct sock
*sk2
) )
141 struct hlist_node
*node
;
142 struct hlist_head
*head
;
146 write_lock_bh(&udp_hash_lock
);
150 int low
= sysctl_local_port_range
[0];
151 int high
= sysctl_local_port_range
[1];
152 unsigned rover
, best
, best_size_so_far
;
154 best_size_so_far
= UINT_MAX
;
155 best
= rover
= net_random() % (high
- low
) + low
;
157 /* 1st pass: look for empty (or shortest) hash chain */
158 for (i
= 0; i
< UDP_HTABLE_SIZE
; i
++) {
161 head
= &udptable
[rover
& (UDP_HTABLE_SIZE
- 1)];
162 if (hlist_empty(head
))
165 sk_for_each(sk2
, node
, head
) {
166 if (++size
>= best_size_so_far
)
169 best_size_so_far
= size
;
172 /* fold back if end of range */
174 rover
= low
+ ((rover
- low
)
175 & (UDP_HTABLE_SIZE
- 1));
180 /* 2nd pass: find hole in shortest hash chain */
182 for (i
= 0; i
< (1 << 16) / UDP_HTABLE_SIZE
; i
++) {
183 if (! __udp_lib_lport_inuse(rover
, udptable
))
185 rover
+= UDP_HTABLE_SIZE
;
187 rover
= low
+ ((rover
- low
)
188 & (UDP_HTABLE_SIZE
- 1));
192 /* All ports in use! */
198 head
= &udptable
[snum
& (UDP_HTABLE_SIZE
- 1)];
200 sk_for_each(sk2
, node
, head
)
201 if (sk2
->sk_hash
== snum
&&
203 (!sk2
->sk_reuse
|| !sk
->sk_reuse
) &&
204 (!sk2
->sk_bound_dev_if
|| !sk
->sk_bound_dev_if
205 || sk2
->sk_bound_dev_if
== sk
->sk_bound_dev_if
) &&
206 (*saddr_comp
)(sk
, sk2
) )
210 inet_sk(sk
)->num
= snum
;
212 if (sk_unhashed(sk
)) {
213 head
= &udptable
[snum
& (UDP_HTABLE_SIZE
- 1)];
214 sk_add_node(sk
, head
);
215 sock_prot_inc_use(sk
->sk_prot
);
219 write_unlock_bh(&udp_hash_lock
);
223 int udp_get_port(struct sock
*sk
, unsigned short snum
,
224 int (*scmp
)(const struct sock
*, const struct sock
*))
226 return __udp_lib_get_port(sk
, snum
, udp_hash
, scmp
);
229 int ipv4_rcv_saddr_equal(const struct sock
*sk1
, const struct sock
*sk2
)
231 struct inet_sock
*inet1
= inet_sk(sk1
), *inet2
= inet_sk(sk2
);
233 return ( !ipv6_only_sock(sk2
) &&
234 (!inet1
->rcv_saddr
|| !inet2
->rcv_saddr
||
235 inet1
->rcv_saddr
== inet2
->rcv_saddr
));
238 static inline int udp_v4_get_port(struct sock
*sk
, unsigned short snum
)
240 return udp_get_port(sk
, snum
, ipv4_rcv_saddr_equal
);
243 /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
244 * harder than this. -DaveM
246 static struct sock
*__udp4_lib_lookup(__be32 saddr
, __be16 sport
,
247 __be32 daddr
, __be16 dport
,
248 int dif
, struct hlist_head udptable
[])
250 struct sock
*sk
, *result
= NULL
;
251 struct hlist_node
*node
;
252 unsigned short hnum
= ntohs(dport
);
255 read_lock(&udp_hash_lock
);
256 sk_for_each(sk
, node
, &udptable
[hnum
& (UDP_HTABLE_SIZE
- 1)]) {
257 struct inet_sock
*inet
= inet_sk(sk
);
259 if (sk
->sk_hash
== hnum
&& !ipv6_only_sock(sk
)) {
260 int score
= (sk
->sk_family
== PF_INET
? 1 : 0);
261 if (inet
->rcv_saddr
) {
262 if (inet
->rcv_saddr
!= daddr
)
267 if (inet
->daddr
!= saddr
)
272 if (inet
->dport
!= sport
)
276 if (sk
->sk_bound_dev_if
) {
277 if (sk
->sk_bound_dev_if
!= dif
)
284 } else if (score
> badness
) {
292 read_unlock(&udp_hash_lock
);
296 static inline struct sock
*__udp4_lib_lookup_skb(struct sk_buff
*skb
,
297 __be16 sport
, __be16 dport
,
298 struct hlist_head udptable
[])
301 const struct iphdr
*iph
= ip_hdr(skb
);
303 if (unlikely(sk
= skb_steal_sock(skb
)))
306 return __udp4_lib_lookup(iph
->saddr
, sport
,
307 iph
->daddr
, dport
, skb
->dev
->ifindex
,
311 static inline struct sock
*udp_v4_mcast_next(struct sock
*sk
,
312 __be16 loc_port
, __be32 loc_addr
,
313 __be16 rmt_port
, __be32 rmt_addr
,
316 struct hlist_node
*node
;
318 unsigned short hnum
= ntohs(loc_port
);
320 sk_for_each_from(s
, node
) {
321 struct inet_sock
*inet
= inet_sk(s
);
323 if (s
->sk_hash
!= hnum
||
324 (inet
->daddr
&& inet
->daddr
!= rmt_addr
) ||
325 (inet
->dport
!= rmt_port
&& inet
->dport
) ||
326 (inet
->rcv_saddr
&& inet
->rcv_saddr
!= loc_addr
) ||
328 (s
->sk_bound_dev_if
&& s
->sk_bound_dev_if
!= dif
))
330 if (!ip_mc_sf_allow(s
, loc_addr
, rmt_addr
, dif
))
340 * This routine is called by the ICMP module when it gets some
341 * sort of error condition. If err < 0 then the socket should
342 * be closed and the error returned to the user. If err > 0
343 * it's just the icmp type << 8 | icmp code.
344 * Header points to the ip header of the error packet. We move
345 * on past this. Then (as it used to claim before adjustment)
346 * header points to the first 8 bytes of the udp header. We need
347 * to find the appropriate port.
350 void __udp4_lib_err(struct sk_buff
*skb
, u32 info
, struct hlist_head udptable
[])
352 struct inet_sock
*inet
;
353 struct iphdr
*iph
= (struct iphdr
*)skb
->data
;
354 struct udphdr
*uh
= (struct udphdr
*)(skb
->data
+(iph
->ihl
<<2));
355 const int type
= icmp_hdr(skb
)->type
;
356 const int code
= icmp_hdr(skb
)->code
;
361 sk
= __udp4_lib_lookup(iph
->daddr
, uh
->dest
, iph
->saddr
, uh
->source
,
362 skb
->dev
->ifindex
, udptable
);
364 ICMP_INC_STATS_BH(ICMP_MIB_INERRORS
);
365 return; /* No socket for error */
374 case ICMP_TIME_EXCEEDED
:
377 case ICMP_SOURCE_QUENCH
:
379 case ICMP_PARAMETERPROB
:
383 case ICMP_DEST_UNREACH
:
384 if (code
== ICMP_FRAG_NEEDED
) { /* Path MTU discovery */
385 if (inet
->pmtudisc
!= IP_PMTUDISC_DONT
) {
393 if (code
<= NR_ICMP_UNREACH
) {
394 harderr
= icmp_err_convert
[code
].fatal
;
395 err
= icmp_err_convert
[code
].errno
;
401 * RFC1122: OK. Passes ICMP errors back to application, as per
404 if (!inet
->recverr
) {
405 if (!harderr
|| sk
->sk_state
!= TCP_ESTABLISHED
)
408 ip_icmp_error(sk
, skb
, err
, uh
->dest
, info
, (u8
*)(uh
+1));
411 sk
->sk_error_report(sk
);
416 void udp_err(struct sk_buff
*skb
, u32 info
)
418 return __udp4_lib_err(skb
, info
, udp_hash
);
422 * Throw away all pending data and cancel the corking. Socket is locked.
424 static void udp_flush_pending_frames(struct sock
*sk
)
426 struct udp_sock
*up
= udp_sk(sk
);
431 ip_flush_pending_frames(sk
);
436 * udp4_hwcsum_outgoing - handle outgoing HW checksumming
437 * @sk: socket we are sending on
438 * @skb: sk_buff containing the filled-in UDP header
439 * (checksum field must be zeroed out)
441 static void udp4_hwcsum_outgoing(struct sock
*sk
, struct sk_buff
*skb
,
442 __be32 src
, __be32 dst
, int len
)
445 struct udphdr
*uh
= udp_hdr(skb
);
448 if (skb_queue_len(&sk
->sk_write_queue
) == 1) {
450 * Only one fragment on the socket.
452 skb
->csum_start
= skb_transport_header(skb
) - skb
->head
;
453 skb
->csum_offset
= offsetof(struct udphdr
, check
);
454 uh
->check
= ~csum_tcpudp_magic(src
, dst
, len
, IPPROTO_UDP
, 0);
457 * HW-checksum won't work as there are two or more
458 * fragments on the socket so that all csums of sk_buffs
461 offset
= skb_transport_offset(skb
);
462 skb
->csum
= skb_checksum(skb
, offset
, skb
->len
- offset
, 0);
464 skb
->ip_summed
= CHECKSUM_NONE
;
466 skb_queue_walk(&sk
->sk_write_queue
, skb
) {
467 csum
= csum_add(csum
, skb
->csum
);
470 uh
->check
= csum_tcpudp_magic(src
, dst
, len
, IPPROTO_UDP
, csum
);
472 uh
->check
= CSUM_MANGLED_0
;
477 * Push out all pending data as one UDP datagram. Socket is locked.
479 static int udp_push_pending_frames(struct sock
*sk
)
481 struct udp_sock
*up
= udp_sk(sk
);
482 struct inet_sock
*inet
= inet_sk(sk
);
483 struct flowi
*fl
= &inet
->cork
.fl
;
489 /* Grab the skbuff where UDP header space exists. */
490 if ((skb
= skb_peek(&sk
->sk_write_queue
)) == NULL
)
494 * Create a UDP header
497 uh
->source
= fl
->fl_ip_sport
;
498 uh
->dest
= fl
->fl_ip_dport
;
499 uh
->len
= htons(up
->len
);
502 if (up
->pcflag
) /* UDP-Lite */
503 csum
= udplite_csum_outgoing(sk
, skb
);
505 else if (sk
->sk_no_check
== UDP_CSUM_NOXMIT
) { /* UDP csum disabled */
507 skb
->ip_summed
= CHECKSUM_NONE
;
510 } else if (skb
->ip_summed
== CHECKSUM_PARTIAL
) { /* UDP hardware csum */
512 udp4_hwcsum_outgoing(sk
, skb
, fl
->fl4_src
,fl
->fl4_dst
, up
->len
);
515 } else /* `normal' UDP */
516 csum
= udp_csum_outgoing(sk
, skb
);
518 /* add protocol-dependent pseudo-header */
519 uh
->check
= csum_tcpudp_magic(fl
->fl4_src
, fl
->fl4_dst
, up
->len
,
520 sk
->sk_protocol
, csum
);
522 uh
->check
= CSUM_MANGLED_0
;
525 err
= ip_push_pending_frames(sk
);
532 int udp_sendmsg(struct kiocb
*iocb
, struct sock
*sk
, struct msghdr
*msg
,
535 struct inet_sock
*inet
= inet_sk(sk
);
536 struct udp_sock
*up
= udp_sk(sk
);
538 struct ipcm_cookie ipc
;
539 struct rtable
*rt
= NULL
;
542 __be32 daddr
, faddr
, saddr
;
545 int err
, is_udplite
= up
->pcflag
;
546 int corkreq
= up
->corkflag
|| msg
->msg_flags
&MSG_MORE
;
547 int (*getfrag
)(void *, char *, int, int, int, struct sk_buff
*);
556 if (msg
->msg_flags
&MSG_OOB
) /* Mirror BSD error message compatibility */
563 * There are pending frames.
564 * The socket lock must be held while it's corked.
567 if (likely(up
->pending
)) {
568 if (unlikely(up
->pending
!= AF_INET
)) {
576 ulen
+= sizeof(struct udphdr
);
579 * Get and verify the address.
582 struct sockaddr_in
* usin
= (struct sockaddr_in
*)msg
->msg_name
;
583 if (msg
->msg_namelen
< sizeof(*usin
))
585 if (usin
->sin_family
!= AF_INET
) {
586 if (usin
->sin_family
!= AF_UNSPEC
)
587 return -EAFNOSUPPORT
;
590 daddr
= usin
->sin_addr
.s_addr
;
591 dport
= usin
->sin_port
;
595 if (sk
->sk_state
!= TCP_ESTABLISHED
)
596 return -EDESTADDRREQ
;
599 /* Open fast path for connected socket.
600 Route will not be used, if at least one option is set.
604 ipc
.addr
= inet
->saddr
;
606 ipc
.oif
= sk
->sk_bound_dev_if
;
607 if (msg
->msg_controllen
) {
608 err
= ip_cmsg_send(msg
, &ipc
);
619 ipc
.addr
= faddr
= daddr
;
621 if (ipc
.opt
&& ipc
.opt
->srr
) {
624 faddr
= ipc
.opt
->faddr
;
627 tos
= RT_TOS(inet
->tos
);
628 if (sock_flag(sk
, SOCK_LOCALROUTE
) ||
629 (msg
->msg_flags
& MSG_DONTROUTE
) ||
630 (ipc
.opt
&& ipc
.opt
->is_strictroute
)) {
635 if (MULTICAST(daddr
)) {
637 ipc
.oif
= inet
->mc_index
;
639 saddr
= inet
->mc_addr
;
644 rt
= (struct rtable
*)sk_dst_check(sk
, 0);
647 struct flowi fl
= { .oif
= ipc
.oif
,
652 .proto
= sk
->sk_protocol
,
654 { .sport
= inet
->sport
,
655 .dport
= dport
} } };
656 security_sk_classify_flow(sk
, &fl
);
657 err
= ip_route_output_flow(&rt
, &fl
, sk
, 1);
659 if (err
== -ENETUNREACH
)
660 IP_INC_STATS_BH(IPSTATS_MIB_OUTNOROUTES
);
665 if ((rt
->rt_flags
& RTCF_BROADCAST
) &&
666 !sock_flag(sk
, SOCK_BROADCAST
))
669 sk_dst_set(sk
, dst_clone(&rt
->u
.dst
));
672 if (msg
->msg_flags
&MSG_CONFIRM
)
678 daddr
= ipc
.addr
= rt
->rt_dst
;
681 if (unlikely(up
->pending
)) {
682 /* The socket is already corked while preparing it. */
683 /* ... which is an evident application bug. --ANK */
686 LIMIT_NETDEBUG(KERN_DEBUG
"udp cork app bug 2\n");
691 * Now cork the socket to pend data.
693 inet
->cork
.fl
.fl4_dst
= daddr
;
694 inet
->cork
.fl
.fl_ip_dport
= dport
;
695 inet
->cork
.fl
.fl4_src
= saddr
;
696 inet
->cork
.fl
.fl_ip_sport
= inet
->sport
;
697 up
->pending
= AF_INET
;
701 getfrag
= is_udplite
? udplite_getfrag
: ip_generic_getfrag
;
702 err
= ip_append_data(sk
, getfrag
, msg
->msg_iov
, ulen
,
703 sizeof(struct udphdr
), &ipc
, rt
,
704 corkreq
? msg
->msg_flags
|MSG_MORE
: msg
->msg_flags
);
706 udp_flush_pending_frames(sk
);
708 err
= udp_push_pending_frames(sk
);
709 else if (unlikely(skb_queue_empty(&sk
->sk_write_queue
)))
718 UDP_INC_STATS_USER(UDP_MIB_OUTDATAGRAMS
, is_udplite
);
722 * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
723 * ENOBUFS might not be good (it's not tunable per se), but otherwise
724 * we don't have a good statistic (IpOutDiscards but it can be too many
725 * things). We could add another new stat but at least for now that
726 * seems like overkill.
728 if (err
== -ENOBUFS
|| test_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
)) {
729 UDP_INC_STATS_USER(UDP_MIB_SNDBUFERRORS
, is_udplite
);
734 dst_confirm(&rt
->u
.dst
);
735 if (!(msg
->msg_flags
&MSG_PROBE
) || len
)
736 goto back_from_confirm
;
741 int udp_sendpage(struct sock
*sk
, struct page
*page
, int offset
,
742 size_t size
, int flags
)
744 struct udp_sock
*up
= udp_sk(sk
);
748 struct msghdr msg
= { .msg_flags
= flags
|MSG_MORE
};
750 /* Call udp_sendmsg to specify destination address which
751 * sendpage interface can't pass.
752 * This will succeed only when the socket is connected.
754 ret
= udp_sendmsg(NULL
, sk
, &msg
, 0);
761 if (unlikely(!up
->pending
)) {
764 LIMIT_NETDEBUG(KERN_DEBUG
"udp cork app bug 3\n");
768 ret
= ip_append_page(sk
, page
, offset
, size
, flags
);
769 if (ret
== -EOPNOTSUPP
) {
771 return sock_no_sendpage(sk
->sk_socket
, page
, offset
,
775 udp_flush_pending_frames(sk
);
780 if (!(up
->corkflag
|| (flags
&MSG_MORE
)))
781 ret
= udp_push_pending_frames(sk
);
790 * IOCTL requests applicable to the UDP protocol
793 int udp_ioctl(struct sock
*sk
, int cmd
, unsigned long arg
)
798 int amount
= sk_wmem_alloc_get(sk
);
800 return put_user(amount
, (int __user
*)arg
);
806 unsigned long amount
;
809 spin_lock_bh(&sk
->sk_receive_queue
.lock
);
810 skb
= skb_peek(&sk
->sk_receive_queue
);
813 * We will only return the amount
814 * of this packet since that is all
817 amount
= skb
->len
- sizeof(struct udphdr
);
819 spin_unlock_bh(&sk
->sk_receive_queue
.lock
);
820 return put_user(amount
, (int __user
*)arg
);
831 * This should be easy, if there is something there we
832 * return it, otherwise we block.
835 int udp_recvmsg(struct kiocb
*iocb
, struct sock
*sk
, struct msghdr
*msg
,
836 size_t len
, int noblock
, int flags
, int *addr_len
)
838 struct inet_sock
*inet
= inet_sk(sk
);
839 struct sockaddr_in
*sin
= (struct sockaddr_in
*)msg
->msg_name
;
841 unsigned int ulen
, copied
;
843 int is_udplite
= IS_UDPLITE(sk
);
846 * Check any passed addresses
849 *addr_len
=sizeof(*sin
);
851 if (flags
& MSG_ERRQUEUE
)
852 return ip_recv_error(sk
, msg
, len
);
855 skb
= skb_recv_datagram(sk
, flags
, noblock
, &err
);
859 ulen
= skb
->len
- sizeof(struct udphdr
);
863 else if (copied
< ulen
)
864 msg
->msg_flags
|= MSG_TRUNC
;
867 * If checksum is needed at all, try to do it while copying the
868 * data. If the data is truncated, or if we only want a partial
869 * coverage checksum (UDP-Lite), do it before the copy.
872 if (copied
< ulen
|| UDP_SKB_CB(skb
)->partial_cov
) {
873 if (udp_lib_checksum_complete(skb
))
877 if (skb_csum_unnecessary(skb
))
878 err
= skb_copy_datagram_iovec(skb
, sizeof(struct udphdr
),
879 msg
->msg_iov
, copied
);
881 err
= skb_copy_and_csum_datagram_iovec(skb
, sizeof(struct udphdr
), msg
->msg_iov
);
890 sock_recv_timestamp(msg
, sk
, skb
);
892 /* Copy the address. */
895 sin
->sin_family
= AF_INET
;
896 sin
->sin_port
= udp_hdr(skb
)->source
;
897 sin
->sin_addr
.s_addr
= ip_hdr(skb
)->saddr
;
898 memset(sin
->sin_zero
, 0, sizeof(sin
->sin_zero
));
900 if (inet
->cmsg_flags
)
901 ip_cmsg_recv(msg
, skb
);
904 if (flags
& MSG_TRUNC
)
908 skb_free_datagram_locked(sk
, skb
);
913 UDP_INC_STATS_BH(UDP_MIB_INERRORS
, is_udplite
);
915 skb_kill_datagram(sk
, skb
, flags
);
923 int udp_disconnect(struct sock
*sk
, int flags
)
925 struct inet_sock
*inet
= inet_sk(sk
);
927 * 1003.1g - break association.
930 sk
->sk_state
= TCP_CLOSE
;
933 sk
->sk_bound_dev_if
= 0;
934 if (!(sk
->sk_userlocks
& SOCK_BINDADDR_LOCK
))
935 inet_reset_saddr(sk
);
937 if (!(sk
->sk_userlocks
& SOCK_BINDPORT_LOCK
)) {
938 sk
->sk_prot
->unhash(sk
);
948 * >0: "udp encap" protocol resubmission
950 * Note that in the success and error cases, the skb is assumed to
951 * have either been requeued or freed.
953 int udp_queue_rcv_skb(struct sock
* sk
, struct sk_buff
*skb
)
955 struct udp_sock
*up
= udp_sk(sk
);
959 * Charge it to the socket, dropping if the queue is full.
961 if (!xfrm4_policy_check(sk
, XFRM_POLICY_IN
, skb
))
965 if (up
->encap_type
) {
967 * This is an encapsulation socket so pass the skb to
968 * the socket's udp_encap_rcv() hook. Otherwise, just
969 * fall through and pass this up the UDP socket.
970 * up->encap_rcv() returns the following value:
971 * =0 if skb was successfully passed to the encap
972 * handler or was discarded by it.
973 * >0 if skb should be passed on to UDP.
974 * <0 if skb should be resubmitted as proto -N
977 /* if we're overly short, let UDP handle it */
978 if (skb
->len
> sizeof(struct udphdr
) &&
979 up
->encap_rcv
!= NULL
) {
982 ret
= (*up
->encap_rcv
)(sk
, skb
);
984 UDP_INC_STATS_BH(UDP_MIB_INDATAGRAMS
, up
->pcflag
);
989 /* FALLTHROUGH -- it's a UDP Packet */
993 * UDP-Lite specific tests, ignored on UDP sockets
995 if ((up
->pcflag
& UDPLITE_RECV_CC
) && UDP_SKB_CB(skb
)->partial_cov
) {
998 * MIB statistics other than incrementing the error count are
999 * disabled for the following two types of errors: these depend
1000 * on the application settings, not on the functioning of the
1001 * protocol stack as such.
1003 * RFC 3828 here recommends (sec 3.3): "There should also be a
1004 * way ... to ... at least let the receiving application block
1005 * delivery of packets with coverage values less than a value
1006 * provided by the application."
1008 if (up
->pcrlen
== 0) { /* full coverage was set */
1009 LIMIT_NETDEBUG(KERN_WARNING
"UDPLITE: partial coverage "
1010 "%d while full coverage %d requested\n",
1011 UDP_SKB_CB(skb
)->cscov
, skb
->len
);
1014 /* The next case involves violating the min. coverage requested
1015 * by the receiver. This is subtle: if receiver wants x and x is
1016 * greater than the buffersize/MTU then receiver will complain
1017 * that it wants x while sender emits packets of smaller size y.
1018 * Therefore the above ...()->partial_cov statement is essential.
1020 if (UDP_SKB_CB(skb
)->cscov
< up
->pcrlen
) {
1021 LIMIT_NETDEBUG(KERN_WARNING
1022 "UDPLITE: coverage %d too small, need min %d\n",
1023 UDP_SKB_CB(skb
)->cscov
, up
->pcrlen
);
1028 if (sk
->sk_filter
) {
1029 if (udp_lib_checksum_complete(skb
))
1033 if ((rc
= sock_queue_rcv_skb(sk
,skb
)) < 0) {
1034 /* Note that an ENOMEM error is charged twice */
1036 UDP_INC_STATS_BH(UDP_MIB_RCVBUFERRORS
, up
->pcflag
);
1040 UDP_INC_STATS_BH(UDP_MIB_INDATAGRAMS
, up
->pcflag
);
1044 UDP_INC_STATS_BH(UDP_MIB_INERRORS
, up
->pcflag
);
1050 * Multicasts and broadcasts go to each listener.
1052 * Note: called only from the BH handler context,
1053 * so we don't need to lock the hashes.
1055 static int __udp4_lib_mcast_deliver(struct sk_buff
*skb
,
1057 __be32 saddr
, __be32 daddr
,
1058 struct hlist_head udptable
[])
1063 read_lock(&udp_hash_lock
);
1064 sk
= sk_head(&udptable
[ntohs(uh
->dest
) & (UDP_HTABLE_SIZE
- 1)]);
1065 dif
= skb
->dev
->ifindex
;
1066 sk
= udp_v4_mcast_next(sk
, uh
->dest
, daddr
, uh
->source
, saddr
, dif
);
1068 struct sock
*sknext
= NULL
;
1071 struct sk_buff
*skb1
= skb
;
1073 sknext
= udp_v4_mcast_next(sk_next(sk
), uh
->dest
, daddr
,
1074 uh
->source
, saddr
, dif
);
1076 skb1
= skb_clone(skb
, GFP_ATOMIC
);
1079 int ret
= udp_queue_rcv_skb(sk
, skb1
);
1081 /* we should probably re-process instead
1082 * of dropping packets here. */
1089 read_unlock(&udp_hash_lock
);
1093 /* Initialize UDP checksum. If exited with zero value (success),
1094 * CHECKSUM_UNNECESSARY means, that no more checks are required.
1095 * Otherwise, csum completion requires chacksumming packet body,
1096 * including udp header and folding it to skb->csum.
1098 static inline int udp4_csum_init(struct sk_buff
*skb
, struct udphdr
*uh
,
1101 const struct iphdr
*iph
;
1104 UDP_SKB_CB(skb
)->partial_cov
= 0;
1105 UDP_SKB_CB(skb
)->cscov
= skb
->len
;
1107 if (proto
== IPPROTO_UDPLITE
) {
1108 err
= udplite_checksum_init(skb
, uh
);
1114 if (uh
->check
== 0) {
1115 skb
->ip_summed
= CHECKSUM_UNNECESSARY
;
1116 } else if (skb
->ip_summed
== CHECKSUM_COMPLETE
) {
1117 if (!csum_tcpudp_magic(iph
->saddr
, iph
->daddr
, skb
->len
,
1119 skb
->ip_summed
= CHECKSUM_UNNECESSARY
;
1121 if (!skb_csum_unnecessary(skb
))
1122 skb
->csum
= csum_tcpudp_nofold(iph
->saddr
, iph
->daddr
,
1123 skb
->len
, proto
, 0);
1124 /* Probably, we should checksum udp header (it should be in cache
1125 * in any case) and data in tiny packets (< rx copybreak).
1132 * All we need to do is get the socket, and then do a checksum.
1135 int __udp4_lib_rcv(struct sk_buff
*skb
, struct hlist_head udptable
[],
1139 struct udphdr
*uh
= udp_hdr(skb
);
1140 unsigned short ulen
;
1141 struct rtable
*rt
= (struct rtable
*)skb
->dst
;
1142 __be32 saddr
, daddr
;
1145 * Validate the packet.
1147 if (!pskb_may_pull(skb
, sizeof(struct udphdr
)))
1148 goto drop
; /* No space for header. */
1150 ulen
= ntohs(uh
->len
);
1151 if (ulen
> skb
->len
)
1154 if (proto
== IPPROTO_UDP
) {
1155 /* UDP validates ulen. */
1156 if (ulen
< sizeof(*uh
) || pskb_trim_rcsum(skb
, ulen
))
1161 if (udp4_csum_init(skb
, uh
, proto
))
1164 saddr
= ip_hdr(skb
)->saddr
;
1165 daddr
= ip_hdr(skb
)->daddr
;
1167 if (rt
->rt_flags
& (RTCF_BROADCAST
|RTCF_MULTICAST
))
1168 return __udp4_lib_mcast_deliver(skb
, uh
, saddr
, daddr
, udptable
);
1170 sk
= __udp4_lib_lookup_skb(skb
, uh
->source
, uh
->dest
, udptable
);
1173 int ret
= udp_queue_rcv_skb(sk
, skb
);
1176 /* a return value > 0 means to resubmit the input, but
1177 * it wants the return to be -protocol, or 0
1184 if (!xfrm4_policy_check(NULL
, XFRM_POLICY_IN
, skb
))
1188 /* No socket. Drop packet silently, if checksum is wrong */
1189 if (udp_lib_checksum_complete(skb
))
1192 UDP_INC_STATS_BH(UDP_MIB_NOPORTS
, proto
== IPPROTO_UDPLITE
);
1193 icmp_send(skb
, ICMP_DEST_UNREACH
, ICMP_PORT_UNREACH
, 0);
1196 * Hmm. We got an UDP packet to a port to which we
1197 * don't wanna listen. Ignore it.
1203 LIMIT_NETDEBUG(KERN_DEBUG
"UDP%s: short packet: From %u.%u.%u.%u:%u %d/%d to %u.%u.%u.%u:%u\n",
1204 proto
== IPPROTO_UDPLITE
? "-Lite" : "",
1215 * RFC1122: OK. Discards the bad packet silently (as far as
1216 * the network is concerned, anyway) as per 4.1.3.4 (MUST).
1218 LIMIT_NETDEBUG(KERN_DEBUG
"UDP%s: bad checksum. From %d.%d.%d.%d:%d to %d.%d.%d.%d:%d ulen %d\n",
1219 proto
== IPPROTO_UDPLITE
? "-Lite" : "",
1226 UDP_INC_STATS_BH(UDP_MIB_INERRORS
, proto
== IPPROTO_UDPLITE
);
1231 int udp_rcv(struct sk_buff
*skb
)
1233 return __udp4_lib_rcv(skb
, udp_hash
, IPPROTO_UDP
);
1236 int udp_destroy_sock(struct sock
*sk
)
1239 udp_flush_pending_frames(sk
);
1245 * Socket option code for UDP
1247 int udp_lib_setsockopt(struct sock
*sk
, int level
, int optname
,
1248 char __user
*optval
, int optlen
,
1249 int (*push_pending_frames
)(struct sock
*))
1251 struct udp_sock
*up
= udp_sk(sk
);
1255 if (optlen
<sizeof(int))
1258 if (get_user(val
, (int __user
*)optval
))
1268 (*push_pending_frames
)(sk
);
1276 case UDP_ENCAP_ESPINUDP
:
1277 case UDP_ENCAP_ESPINUDP_NON_IKE
:
1278 up
->encap_rcv
= xfrm4_udp_encap_rcv
;
1280 case UDP_ENCAP_L2TPINUDP
:
1281 up
->encap_type
= val
;
1290 * UDP-Lite's partial checksum coverage (RFC 3828).
1292 /* The sender sets actual checksum coverage length via this option.
1293 * The case coverage > packet length is handled by send module. */
1294 case UDPLITE_SEND_CSCOV
:
1295 if (!up
->pcflag
) /* Disable the option on UDP sockets */
1296 return -ENOPROTOOPT
;
1297 if (val
!= 0 && val
< 8) /* Illegal coverage: use default (8) */
1300 up
->pcflag
|= UDPLITE_SEND_CC
;
1303 /* The receiver specifies a minimum checksum coverage value. To make
1304 * sense, this should be set to at least 8 (as done below). If zero is
1305 * used, this again means full checksum coverage. */
1306 case UDPLITE_RECV_CSCOV
:
1307 if (!up
->pcflag
) /* Disable the option on UDP sockets */
1308 return -ENOPROTOOPT
;
1309 if (val
!= 0 && val
< 8) /* Avoid silly minimal values. */
1312 up
->pcflag
|= UDPLITE_RECV_CC
;
1323 int udp_setsockopt(struct sock
*sk
, int level
, int optname
,
1324 char __user
*optval
, int optlen
)
1326 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
1327 return udp_lib_setsockopt(sk
, level
, optname
, optval
, optlen
,
1328 udp_push_pending_frames
);
1329 return ip_setsockopt(sk
, level
, optname
, optval
, optlen
);
1332 #ifdef CONFIG_COMPAT
1333 int compat_udp_setsockopt(struct sock
*sk
, int level
, int optname
,
1334 char __user
*optval
, int optlen
)
1336 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
1337 return udp_lib_setsockopt(sk
, level
, optname
, optval
, optlen
,
1338 udp_push_pending_frames
);
1339 return compat_ip_setsockopt(sk
, level
, optname
, optval
, optlen
);
1343 int udp_lib_getsockopt(struct sock
*sk
, int level
, int optname
,
1344 char __user
*optval
, int __user
*optlen
)
1346 struct udp_sock
*up
= udp_sk(sk
);
1349 if (get_user(len
,optlen
))
1352 len
= min_t(unsigned int, len
, sizeof(int));
1363 val
= up
->encap_type
;
1366 /* The following two cannot be changed on UDP sockets, the return is
1367 * always 0 (which corresponds to the full checksum coverage of UDP). */
1368 case UDPLITE_SEND_CSCOV
:
1372 case UDPLITE_RECV_CSCOV
:
1377 return -ENOPROTOOPT
;
1380 if (put_user(len
, optlen
))
1382 if (copy_to_user(optval
, &val
,len
))
1387 int udp_getsockopt(struct sock
*sk
, int level
, int optname
,
1388 char __user
*optval
, int __user
*optlen
)
1390 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
1391 return udp_lib_getsockopt(sk
, level
, optname
, optval
, optlen
);
1392 return ip_getsockopt(sk
, level
, optname
, optval
, optlen
);
1395 #ifdef CONFIG_COMPAT
1396 int compat_udp_getsockopt(struct sock
*sk
, int level
, int optname
,
1397 char __user
*optval
, int __user
*optlen
)
1399 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
1400 return udp_lib_getsockopt(sk
, level
, optname
, optval
, optlen
);
1401 return compat_ip_getsockopt(sk
, level
, optname
, optval
, optlen
);
1405 * udp_poll - wait for a UDP event.
1406 * @file - file struct
1408 * @wait - poll table
1410 * This is same as datagram poll, except for the special case of
1411 * blocking sockets. If application is using a blocking fd
1412 * and a packet with checksum error is in the queue;
1413 * then it could get return from select indicating data available
1414 * but then block when reading it. Add special case code
1415 * to work around these arguably broken applications.
1417 unsigned int udp_poll(struct file
*file
, struct socket
*sock
, poll_table
*wait
)
1419 unsigned int mask
= datagram_poll(file
, sock
, wait
);
1420 struct sock
*sk
= sock
->sk
;
1421 int is_lite
= IS_UDPLITE(sk
);
1423 /* Check for false positives due to checksum errors */
1424 if ( (mask
& POLLRDNORM
) &&
1425 !(file
->f_flags
& O_NONBLOCK
) &&
1426 !(sk
->sk_shutdown
& RCV_SHUTDOWN
)){
1427 struct sk_buff_head
*rcvq
= &sk
->sk_receive_queue
;
1428 struct sk_buff
*skb
;
1430 spin_lock_bh(&rcvq
->lock
);
1431 while ((skb
= skb_peek(rcvq
)) != NULL
&&
1432 udp_lib_checksum_complete(skb
)) {
1433 UDP_INC_STATS_BH(UDP_MIB_INERRORS
, is_lite
);
1434 __skb_unlink(skb
, rcvq
);
1437 spin_unlock_bh(&rcvq
->lock
);
1439 /* nothing to see, move along */
1441 mask
&= ~(POLLIN
| POLLRDNORM
);
1448 struct proto udp_prot
= {
1450 .owner
= THIS_MODULE
,
1451 .close
= udp_lib_close
,
1452 .connect
= ip4_datagram_connect
,
1453 .disconnect
= udp_disconnect
,
1455 .destroy
= udp_destroy_sock
,
1456 .setsockopt
= udp_setsockopt
,
1457 .getsockopt
= udp_getsockopt
,
1458 .sendmsg
= udp_sendmsg
,
1459 .recvmsg
= udp_recvmsg
,
1460 .sendpage
= udp_sendpage
,
1461 .backlog_rcv
= udp_queue_rcv_skb
,
1462 .hash
= udp_lib_hash
,
1463 .unhash
= udp_lib_unhash
,
1464 .get_port
= udp_v4_get_port
,
1465 .obj_size
= sizeof(struct udp_sock
),
1466 #ifdef CONFIG_COMPAT
1467 .compat_setsockopt
= compat_udp_setsockopt
,
1468 .compat_getsockopt
= compat_udp_getsockopt
,
1472 /* ------------------------------------------------------------------------ */
1473 #ifdef CONFIG_PROC_FS
1475 static struct sock
*udp_get_first(struct seq_file
*seq
)
1478 struct udp_iter_state
*state
= seq
->private;
1480 for (state
->bucket
= 0; state
->bucket
< UDP_HTABLE_SIZE
; ++state
->bucket
) {
1481 struct hlist_node
*node
;
1482 sk_for_each(sk
, node
, state
->hashtable
+ state
->bucket
) {
1483 if (sk
->sk_family
== state
->family
)
1492 static struct sock
*udp_get_next(struct seq_file
*seq
, struct sock
*sk
)
1494 struct udp_iter_state
*state
= seq
->private;
1500 } while (sk
&& sk
->sk_family
!= state
->family
);
1502 if (!sk
&& ++state
->bucket
< UDP_HTABLE_SIZE
) {
1503 sk
= sk_head(state
->hashtable
+ state
->bucket
);
1509 static struct sock
*udp_get_idx(struct seq_file
*seq
, loff_t pos
)
1511 struct sock
*sk
= udp_get_first(seq
);
1514 while (pos
&& (sk
= udp_get_next(seq
, sk
)) != NULL
)
1516 return pos
? NULL
: sk
;
1519 static void *udp_seq_start(struct seq_file
*seq
, loff_t
*pos
)
1521 read_lock(&udp_hash_lock
);
1522 return *pos
? udp_get_idx(seq
, *pos
-1) : (void *)1;
1525 static void *udp_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
1530 sk
= udp_get_idx(seq
, 0);
1532 sk
= udp_get_next(seq
, v
);
1538 static void udp_seq_stop(struct seq_file
*seq
, void *v
)
1540 read_unlock(&udp_hash_lock
);
1543 static int udp_seq_open(struct inode
*inode
, struct file
*file
)
1545 struct udp_seq_afinfo
*afinfo
= PDE(inode
)->data
;
1546 struct udp_iter_state
*s
;
1548 s
= __seq_open_private(file
, &afinfo
->seq_ops
,
1549 sizeof(struct udp_iter_state
));
1553 s
->family
= afinfo
->family
;
1554 s
->hashtable
= afinfo
->hashtable
;
1559 /* ------------------------------------------------------------------------ */
1560 int udp_proc_register(struct udp_seq_afinfo
*afinfo
)
1562 struct proc_dir_entry
*p
;
1567 afinfo
->seq_fops
->owner
= afinfo
->owner
;
1568 afinfo
->seq_fops
->open
= udp_seq_open
;
1569 afinfo
->seq_fops
->read
= seq_read
;
1570 afinfo
->seq_fops
->llseek
= seq_lseek
;
1571 afinfo
->seq_fops
->release
= seq_release_private
;
1573 afinfo
->seq_ops
.start
= udp_seq_start
;
1574 afinfo
->seq_ops
.next
= udp_seq_next
;
1575 afinfo
->seq_ops
.stop
= udp_seq_stop
;
1577 p
= proc_net_fops_create(afinfo
->name
, S_IRUGO
, afinfo
->seq_fops
);
1585 void udp_proc_unregister(struct udp_seq_afinfo
*afinfo
)
1589 proc_net_remove(afinfo
->name
);
1590 memset(afinfo
->seq_fops
, 0, sizeof(*afinfo
->seq_fops
));
1593 /* ------------------------------------------------------------------------ */
1594 static void udp4_format_sock(struct sock
*sp
, struct seq_file
*f
,
1595 int bucket
, int *len
)
1597 struct inet_sock
*inet
= inet_sk(sp
);
1598 __be32 dest
= inet
->daddr
;
1599 __be32 src
= inet
->rcv_saddr
;
1600 __u16 destp
= ntohs(inet
->dport
);
1601 __u16 srcp
= ntohs(inet
->sport
);
1603 seq_printf(f
, "%4d: %08X:%04X %08X:%04X"
1604 " %02X %08X:%08X %02X:%08lX %08X %5d %8d %lu %d %p%n",
1605 bucket
, src
, srcp
, dest
, destp
, sp
->sk_state
,
1606 sk_wmem_alloc_get(sp
),
1607 sk_rmem_alloc_get(sp
),
1608 0, 0L, 0, sock_i_uid(sp
), 0, sock_i_ino(sp
),
1609 atomic_read(&sp
->sk_refcnt
), sp
, len
);
1612 int udp4_seq_show(struct seq_file
*seq
, void *v
)
1614 if (v
== SEQ_START_TOKEN
)
1615 seq_printf(seq
, "%-127s\n",
1616 " sl local_address rem_address st tx_queue "
1617 "rx_queue tr tm->when retrnsmt uid timeout "
1620 struct udp_iter_state
*state
= seq
->private;
1623 udp4_format_sock(v
, seq
, state
->bucket
, &len
);
1624 seq_printf(seq
, "%*s\n", 127 - len
,"");
1629 /* ------------------------------------------------------------------------ */
1630 static struct file_operations udp4_seq_fops
;
1631 static struct udp_seq_afinfo udp4_seq_afinfo
= {
1632 .owner
= THIS_MODULE
,
1635 .hashtable
= udp_hash
,
1636 .seq_fops
= &udp4_seq_fops
,
1638 .show
= udp4_seq_show
,
1642 int __init
udp4_proc_init(void)
1644 return udp_proc_register(&udp4_seq_afinfo
);
1647 void udp4_proc_exit(void)
1649 udp_proc_unregister(&udp4_seq_afinfo
);
1651 #endif /* CONFIG_PROC_FS */
1653 EXPORT_SYMBOL(udp_disconnect
);
1654 EXPORT_SYMBOL(udp_hash
);
1655 EXPORT_SYMBOL(udp_hash_lock
);
1656 EXPORT_SYMBOL(udp_ioctl
);
1657 EXPORT_SYMBOL(udp_get_port
);
1658 EXPORT_SYMBOL(udp_prot
);
1659 EXPORT_SYMBOL(udp_sendmsg
);
1660 EXPORT_SYMBOL(udp_lib_getsockopt
);
1661 EXPORT_SYMBOL(udp_lib_setsockopt
);
1662 EXPORT_SYMBOL(udp_poll
);
1664 #ifdef CONFIG_PROC_FS
1665 EXPORT_SYMBOL(udp_proc_register
);
1666 EXPORT_SYMBOL(udp_proc_unregister
);