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.Cox@linux.org>
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 #include <asm/system.h>
81 #include <asm/uaccess.h>
82 #include <asm/ioctls.h>
83 #include <linux/bootmem.h>
84 #include <linux/types.h>
85 #include <linux/fcntl.h>
86 #include <linux/module.h>
87 #include <linux/socket.h>
88 #include <linux/sockios.h>
89 #include <linux/igmp.h>
91 #include <linux/errno.h>
92 #include <linux/timer.h>
94 #include <linux/inet.h>
95 #include <linux/netdevice.h>
96 #include <net/tcp_states.h>
97 #include <linux/skbuff.h>
98 #include <linux/proc_fs.h>
99 #include <linux/seq_file.h>
100 #include <net/net_namespace.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_stats_in6) __read_mostly;
112 EXPORT_SYMBOL(udp_stats_in6);
114 struct hlist_head udp_hash[UDP_HTABLE_SIZE];
115 DEFINE_RWLOCK(udp_hash_lock);
117 int sysctl_udp_mem[3] __read_mostly;
118 int sysctl_udp_rmem_min __read_mostly;
119 int sysctl_udp_wmem_min __read_mostly;
121 EXPORT_SYMBOL(sysctl_udp_mem);
122 EXPORT_SYMBOL(sysctl_udp_rmem_min);
123 EXPORT_SYMBOL(sysctl_udp_wmem_min);
125 atomic_t udp_memory_allocated;
126 EXPORT_SYMBOL(udp_memory_allocated);
128 static inline int __udp_lib_lport_inuse(struct net *net, __u16 num,
129 const struct hlist_head udptable[])
132 struct hlist_node *node;
134 sk_for_each(sk, node, &udptable[udp_hashfn(net, num)])
135 if (net_eq(sock_net(sk), net) && sk->sk_hash == num)
141 * udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
143 * @sk: socket struct in question
144 * @snum: port number to look up
145 * @saddr_comp: AF-dependent comparison of bound local IP addresses
147 int udp_lib_get_port(struct sock *sk, unsigned short snum,
148 int (*saddr_comp)(const struct sock *sk1,
149 const struct sock *sk2 ) )
151 struct hlist_head *udptable = sk->sk_prot->h.udp_hash;
152 struct hlist_node *node;
153 struct hlist_head *head;
156 struct net *net = sock_net(sk);
158 write_lock_bh(&udp_hash_lock);
161 int i, low, high, remaining;
162 unsigned rover, best, best_size_so_far;
164 inet_get_local_port_range(&low, &high);
165 remaining = (high - low) + 1;
167 best_size_so_far = UINT_MAX;
168 best = rover = net_random() % remaining + low;
170 /* 1st pass: look for empty (or shortest) hash chain */
171 for (i = 0; i < UDP_HTABLE_SIZE; i++) {
174 head = &udptable[udp_hashfn(net, rover)];
175 if (hlist_empty(head))
178 sk_for_each(sk2, node, head) {
179 if (++size >= best_size_so_far)
182 best_size_so_far = size;
185 /* fold back if end of range */
187 rover = low + ((rover - low)
188 & (UDP_HTABLE_SIZE - 1));
193 /* 2nd pass: find hole in shortest hash chain */
195 for (i = 0; i < (1 << 16) / UDP_HTABLE_SIZE; i++) {
196 if (! __udp_lib_lport_inuse(net, rover, udptable))
198 rover += UDP_HTABLE_SIZE;
200 rover = low + ((rover - low)
201 & (UDP_HTABLE_SIZE - 1));
205 /* All ports in use! */
211 head = &udptable[udp_hashfn(net, snum)];
213 sk_for_each(sk2, node, head)
214 if (sk2->sk_hash == snum &&
216 net_eq(sock_net(sk2), net) &&
217 (!sk2->sk_reuse || !sk->sk_reuse) &&
218 (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if
219 || sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
220 (*saddr_comp)(sk, sk2) )
224 inet_sk(sk)->num = snum;
226 if (sk_unhashed(sk)) {
227 head = &udptable[udp_hashfn(net, snum)];
228 sk_add_node(sk, head);
229 sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1);
233 write_unlock_bh(&udp_hash_lock);
237 static int ipv4_rcv_saddr_equal(const struct sock *sk1, const struct sock *sk2)
239 struct inet_sock *inet1 = inet_sk(sk1), *inet2 = inet_sk(sk2);
241 return ( !ipv6_only_sock(sk2) &&
242 (!inet1->rcv_saddr || !inet2->rcv_saddr ||
243 inet1->rcv_saddr == inet2->rcv_saddr ));
246 int udp_v4_get_port(struct sock *sk, unsigned short snum)
248 return udp_lib_get_port(sk, snum, ipv4_rcv_saddr_equal);
251 /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
252 * harder than this. -DaveM
254 static struct sock *__udp4_lib_lookup(struct net *net, __be32 saddr,
255 __be16 sport, __be32 daddr, __be16 dport,
256 int dif, struct hlist_head udptable[])
258 struct sock *sk, *result = NULL;
259 struct hlist_node *node;
260 unsigned short hnum = ntohs(dport);
263 read_lock(&udp_hash_lock);
264 sk_for_each(sk, node, &udptable[udp_hashfn(net, hnum)]) {
265 struct inet_sock *inet = inet_sk(sk);
267 if (net_eq(sock_net(sk), net) && sk->sk_hash == hnum &&
268 !ipv6_only_sock(sk)) {
269 int score = (sk->sk_family == PF_INET ? 1 : 0);
270 if (inet->rcv_saddr) {
271 if (inet->rcv_saddr != daddr)
276 if (inet->daddr != saddr)
281 if (inet->dport != sport)
285 if (sk->sk_bound_dev_if) {
286 if (sk->sk_bound_dev_if != dif)
293 } else if (score > badness) {
301 read_unlock(&udp_hash_lock);
305 static inline struct sock *udp_v4_mcast_next(struct sock *sk,
306 __be16 loc_port, __be32 loc_addr,
307 __be16 rmt_port, __be32 rmt_addr,
310 struct hlist_node *node;
312 unsigned short hnum = ntohs(loc_port);
314 sk_for_each_from(s, node) {
315 struct inet_sock *inet = inet_sk(s);
317 if (s->sk_hash != hnum ||
318 (inet->daddr && inet->daddr != rmt_addr) ||
319 (inet->dport != rmt_port && inet->dport) ||
320 (inet->rcv_saddr && inet->rcv_saddr != loc_addr) ||
322 (s->sk_bound_dev_if && s->sk_bound_dev_if != dif))
324 if (!ip_mc_sf_allow(s, loc_addr, rmt_addr, dif))
334 * This routine is called by the ICMP module when it gets some
335 * sort of error condition. If err < 0 then the socket should
336 * be closed and the error returned to the user. If err > 0
337 * it's just the icmp type << 8 | icmp code.
338 * Header points to the ip header of the error packet. We move
339 * on past this. Then (as it used to claim before adjustment)
340 * header points to the first 8 bytes of the udp header. We need
341 * to find the appropriate port.
344 void __udp4_lib_err(struct sk_buff *skb, u32 info, struct hlist_head udptable[])
346 struct inet_sock *inet;
347 struct iphdr *iph = (struct iphdr*)skb->data;
348 struct udphdr *uh = (struct udphdr*)(skb->data+(iph->ihl<<2));
349 const int type = icmp_hdr(skb)->type;
350 const int code = icmp_hdr(skb)->code;
354 struct net *net = dev_net(skb->dev);
356 sk = __udp4_lib_lookup(net, iph->daddr, uh->dest,
357 iph->saddr, uh->source, skb->dev->ifindex, udptable);
359 ICMP_INC_STATS_BH(net, ICMP_MIB_INERRORS);
360 return; /* No socket for error */
369 case ICMP_TIME_EXCEEDED:
372 case ICMP_SOURCE_QUENCH:
374 case ICMP_PARAMETERPROB:
378 case ICMP_DEST_UNREACH:
379 if (code == ICMP_FRAG_NEEDED) { /* Path MTU discovery */
380 if (inet->pmtudisc != IP_PMTUDISC_DONT) {
388 if (code <= NR_ICMP_UNREACH) {
389 harderr = icmp_err_convert[code].fatal;
390 err = icmp_err_convert[code].errno;
396 * RFC1122: OK. Passes ICMP errors back to application, as per
399 if (!inet->recverr) {
400 if (!harderr || sk->sk_state != TCP_ESTABLISHED)
403 ip_icmp_error(sk, skb, err, uh->dest, info, (u8*)(uh+1));
406 sk->sk_error_report(sk);
411 void udp_err(struct sk_buff *skb, u32 info)
413 __udp4_lib_err(skb, info, udp_hash);
417 * Throw away all pending data and cancel the corking. Socket is locked.
419 void udp_flush_pending_frames(struct sock *sk)
421 struct udp_sock *up = udp_sk(sk);
426 ip_flush_pending_frames(sk);
429 EXPORT_SYMBOL(udp_flush_pending_frames);
432 * udp4_hwcsum_outgoing - handle outgoing HW checksumming
433 * @sk: socket we are sending on
434 * @skb: sk_buff containing the filled-in UDP header
435 * (checksum field must be zeroed out)
437 static void udp4_hwcsum_outgoing(struct sock *sk, struct sk_buff *skb,
438 __be32 src, __be32 dst, int len )
441 struct udphdr *uh = udp_hdr(skb);
444 if (skb_queue_len(&sk->sk_write_queue) == 1) {
446 * Only one fragment on the socket.
448 skb->csum_start = skb_transport_header(skb) - skb->head;
449 skb->csum_offset = offsetof(struct udphdr, check);
450 uh->check = ~csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, 0);
453 * HW-checksum won't work as there are two or more
454 * fragments on the socket so that all csums of sk_buffs
457 offset = skb_transport_offset(skb);
458 skb->csum = skb_checksum(skb, offset, skb->len - offset, 0);
460 skb->ip_summed = CHECKSUM_NONE;
462 skb_queue_walk(&sk->sk_write_queue, skb) {
463 csum = csum_add(csum, skb->csum);
466 uh->check = csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, csum);
468 uh->check = CSUM_MANGLED_0;
473 * Push out all pending data as one UDP datagram. Socket is locked.
475 static int udp_push_pending_frames(struct sock *sk)
477 struct udp_sock *up = udp_sk(sk);
478 struct inet_sock *inet = inet_sk(sk);
479 struct flowi *fl = &inet->cork.fl;
483 int is_udplite = IS_UDPLITE(sk);
486 /* Grab the skbuff where UDP header space exists. */
487 if ((skb = skb_peek(&sk->sk_write_queue)) == NULL)
491 * Create a UDP header
494 uh->source = fl->fl_ip_sport;
495 uh->dest = fl->fl_ip_dport;
496 uh->len = htons(up->len);
499 if (is_udplite) /* UDP-Lite */
500 csum = udplite_csum_outgoing(sk, skb);
502 else if (sk->sk_no_check == UDP_CSUM_NOXMIT) { /* UDP csum disabled */
504 skb->ip_summed = CHECKSUM_NONE;
507 } else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */
509 udp4_hwcsum_outgoing(sk, skb, fl->fl4_src,fl->fl4_dst, up->len);
512 } else /* `normal' UDP */
513 csum = udp_csum_outgoing(sk, skb);
515 /* add protocol-dependent pseudo-header */
516 uh->check = csum_tcpudp_magic(fl->fl4_src, fl->fl4_dst, up->len,
517 sk->sk_protocol, csum );
519 uh->check = CSUM_MANGLED_0;
522 err = ip_push_pending_frames(sk);
527 UDP_INC_STATS_USER(sock_net(sk),
528 UDP_MIB_OUTDATAGRAMS, is_udplite);
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 = IS_UDPLITE(sk);
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(sock_net(sk), 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 (ipv4_is_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 struct net *net = sock_net(sk);
658 security_sk_classify_flow(sk, &fl);
659 err = ip_route_output_flow(net, &rt, &fl, sk, 1);
661 if (err == -ENETUNREACH)
662 IP_INC_STATS_BH(net, IPSTATS_MIB_OUTNOROUTES);
667 if ((rt->rt_flags & RTCF_BROADCAST) &&
668 !sock_flag(sk, SOCK_BROADCAST))
671 sk_dst_set(sk, dst_clone(&rt->u.dst));
674 if (msg->msg_flags&MSG_CONFIRM)
680 daddr = ipc.addr = rt->rt_dst;
683 if (unlikely(up->pending)) {
684 /* The socket is already corked while preparing it. */
685 /* ... which is an evident application bug. --ANK */
688 LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 2\n");
693 * Now cork the socket to pend data.
695 inet->cork.fl.fl4_dst = daddr;
696 inet->cork.fl.fl_ip_dport = dport;
697 inet->cork.fl.fl4_src = saddr;
698 inet->cork.fl.fl_ip_sport = inet->sport;
699 up->pending = AF_INET;
703 getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag;
704 err = ip_append_data(sk, getfrag, msg->msg_iov, ulen,
705 sizeof(struct udphdr), &ipc, rt,
706 corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags);
708 udp_flush_pending_frames(sk);
710 err = udp_push_pending_frames(sk);
711 else if (unlikely(skb_queue_empty(&sk->sk_write_queue)))
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(sock_net(sk),
730 UDP_MIB_SNDBUFERRORS, is_udplite);
735 dst_confirm(&rt->u.dst);
736 if (!(msg->msg_flags&MSG_PROBE) || len)
737 goto back_from_confirm;
742 int udp_sendpage(struct sock *sk, struct page *page, int offset,
743 size_t size, int flags)
745 struct udp_sock *up = udp_sk(sk);
749 struct msghdr msg = { .msg_flags = flags|MSG_MORE };
751 /* Call udp_sendmsg to specify destination address which
752 * sendpage interface can't pass.
753 * This will succeed only when the socket is connected.
755 ret = udp_sendmsg(NULL, sk, &msg, 0);
762 if (unlikely(!up->pending)) {
765 LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 3\n");
769 ret = ip_append_page(sk, page, offset, size, flags);
770 if (ret == -EOPNOTSUPP) {
772 return sock_no_sendpage(sk->sk_socket, page, offset,
776 udp_flush_pending_frames(sk);
781 if (!(up->corkflag || (flags&MSG_MORE)))
782 ret = udp_push_pending_frames(sk);
791 * IOCTL requests applicable to the UDP protocol
794 int udp_ioctl(struct sock *sk, int cmd, unsigned long arg)
799 int amount = atomic_read(&sk->sk_wmem_alloc);
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;
844 int is_udplite = IS_UDPLITE(sk);
847 * Check any passed addresses
850 *addr_len=sizeof(*sin);
852 if (flags & MSG_ERRQUEUE)
853 return ip_recv_error(sk, msg, len);
856 skb = __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0),
861 ulen = skb->len - sizeof(struct udphdr);
865 else if (copied < ulen)
866 msg->msg_flags |= MSG_TRUNC;
869 * If checksum is needed at all, try to do it while copying the
870 * data. If the data is truncated, or if we only want a partial
871 * coverage checksum (UDP-Lite), do it before the copy.
874 if (copied < ulen || UDP_SKB_CB(skb)->partial_cov) {
875 if (udp_lib_checksum_complete(skb))
879 if (skb_csum_unnecessary(skb))
880 err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr),
881 msg->msg_iov, copied );
883 err = skb_copy_and_csum_datagram_iovec(skb, sizeof(struct udphdr), msg->msg_iov);
893 UDP_INC_STATS_USER(sock_net(sk),
894 UDP_MIB_INDATAGRAMS, is_udplite);
896 sock_recv_timestamp(msg, sk, skb);
898 /* Copy the address. */
901 sin->sin_family = AF_INET;
902 sin->sin_port = udp_hdr(skb)->source;
903 sin->sin_addr.s_addr = ip_hdr(skb)->saddr;
904 memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
906 if (inet->cmsg_flags)
907 ip_cmsg_recv(msg, skb);
910 if (flags & MSG_TRUNC)
915 skb_free_datagram(sk, skb);
922 if (!skb_kill_datagram(sk, skb, flags))
923 UDP_INC_STATS_USER(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
932 int udp_disconnect(struct sock *sk, int flags)
934 struct inet_sock *inet = inet_sk(sk);
936 * 1003.1g - break association.
939 sk->sk_state = TCP_CLOSE;
942 sk->sk_bound_dev_if = 0;
943 if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
944 inet_reset_saddr(sk);
946 if (!(sk->sk_userlocks & SOCK_BINDPORT_LOCK)) {
947 sk->sk_prot->unhash(sk);
957 * >0: "udp encap" protocol resubmission
959 * Note that in the success and error cases, the skb is assumed to
960 * have either been requeued or freed.
962 int udp_queue_rcv_skb(struct sock * sk, struct sk_buff *skb)
964 struct udp_sock *up = udp_sk(sk);
966 int is_udplite = IS_UDPLITE(sk);
969 * Charge it to the socket, dropping if the queue is full.
971 if (!xfrm4_policy_check(sk, XFRM_POLICY_IN, skb))
975 if (up->encap_type) {
977 * This is an encapsulation socket so pass the skb to
978 * the socket's udp_encap_rcv() hook. Otherwise, just
979 * fall through and pass this up the UDP socket.
980 * up->encap_rcv() returns the following value:
981 * =0 if skb was successfully passed to the encap
982 * handler or was discarded by it.
983 * >0 if skb should be passed on to UDP.
984 * <0 if skb should be resubmitted as proto -N
987 /* if we're overly short, let UDP handle it */
988 if (skb->len > sizeof(struct udphdr) &&
989 up->encap_rcv != NULL) {
992 ret = (*up->encap_rcv)(sk, skb);
994 UDP_INC_STATS_BH(sock_net(sk),
1001 /* FALLTHROUGH -- it's a UDP Packet */
1005 * UDP-Lite specific tests, ignored on UDP sockets
1007 if ((is_udplite & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) {
1010 * MIB statistics other than incrementing the error count are
1011 * disabled for the following two types of errors: these depend
1012 * on the application settings, not on the functioning of the
1013 * protocol stack as such.
1015 * RFC 3828 here recommends (sec 3.3): "There should also be a
1016 * way ... to ... at least let the receiving application block
1017 * delivery of packets with coverage values less than a value
1018 * provided by the application."
1020 if (up->pcrlen == 0) { /* full coverage was set */
1021 LIMIT_NETDEBUG(KERN_WARNING "UDPLITE: partial coverage "
1022 "%d while full coverage %d requested\n",
1023 UDP_SKB_CB(skb)->cscov, skb->len);
1026 /* The next case involves violating the min. coverage requested
1027 * by the receiver. This is subtle: if receiver wants x and x is
1028 * greater than the buffersize/MTU then receiver will complain
1029 * that it wants x while sender emits packets of smaller size y.
1030 * Therefore the above ...()->partial_cov statement is essential.
1032 if (UDP_SKB_CB(skb)->cscov < up->pcrlen) {
1033 LIMIT_NETDEBUG(KERN_WARNING
1034 "UDPLITE: coverage %d too small, need min %d\n",
1035 UDP_SKB_CB(skb)->cscov, up->pcrlen);
1040 if (sk->sk_filter) {
1041 if (udp_lib_checksum_complete(skb))
1045 if ((rc = sock_queue_rcv_skb(sk,skb)) < 0) {
1046 /* Note that an ENOMEM error is charged twice */
1047 if (rc == -ENOMEM) {
1048 UDP_INC_STATS_BH(sock_net(sk),
1049 UDP_MIB_RCVBUFERRORS, is_udplite);
1050 atomic_inc(&sk->sk_drops);
1058 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1064 * Multicasts and broadcasts go to each listener.
1066 * Note: called only from the BH handler context,
1067 * so we don't need to lock the hashes.
1069 static int __udp4_lib_mcast_deliver(struct net *net, struct sk_buff *skb,
1071 __be32 saddr, __be32 daddr,
1072 struct hlist_head udptable[])
1077 read_lock(&udp_hash_lock);
1078 sk = sk_head(&udptable[udp_hashfn(net, ntohs(uh->dest))]);
1079 dif = skb->dev->ifindex;
1080 sk = udp_v4_mcast_next(sk, uh->dest, daddr, uh->source, saddr, dif);
1082 struct sock *sknext = NULL;
1085 struct sk_buff *skb1 = skb;
1087 sknext = udp_v4_mcast_next(sk_next(sk), uh->dest, daddr,
1088 uh->source, saddr, dif);
1090 skb1 = skb_clone(skb, GFP_ATOMIC);
1095 bh_lock_sock_nested(sk);
1096 if (!sock_owned_by_user(sk))
1097 ret = udp_queue_rcv_skb(sk, skb1);
1099 sk_add_backlog(sk, skb1);
1103 /* we should probably re-process instead
1104 * of dropping packets here. */
1111 read_unlock(&udp_hash_lock);
1115 /* Initialize UDP checksum. If exited with zero value (success),
1116 * CHECKSUM_UNNECESSARY means, that no more checks are required.
1117 * Otherwise, csum completion requires chacksumming packet body,
1118 * including udp header and folding it to skb->csum.
1120 static inline int udp4_csum_init(struct sk_buff *skb, struct udphdr *uh,
1123 const struct iphdr *iph;
1126 UDP_SKB_CB(skb)->partial_cov = 0;
1127 UDP_SKB_CB(skb)->cscov = skb->len;
1129 if (proto == IPPROTO_UDPLITE) {
1130 err = udplite_checksum_init(skb, uh);
1136 if (uh->check == 0) {
1137 skb->ip_summed = CHECKSUM_UNNECESSARY;
1138 } else if (skb->ip_summed == CHECKSUM_COMPLETE) {
1139 if (!csum_tcpudp_magic(iph->saddr, iph->daddr, skb->len,
1141 skb->ip_summed = CHECKSUM_UNNECESSARY;
1143 if (!skb_csum_unnecessary(skb))
1144 skb->csum = csum_tcpudp_nofold(iph->saddr, iph->daddr,
1145 skb->len, proto, 0);
1146 /* Probably, we should checksum udp header (it should be in cache
1147 * in any case) and data in tiny packets (< rx copybreak).
1154 * All we need to do is get the socket, and then do a checksum.
1157 int __udp4_lib_rcv(struct sk_buff *skb, struct hlist_head udptable[],
1161 struct udphdr *uh = udp_hdr(skb);
1162 unsigned short ulen;
1163 struct rtable *rt = (struct rtable*)skb->dst;
1164 __be32 saddr = ip_hdr(skb)->saddr;
1165 __be32 daddr = ip_hdr(skb)->daddr;
1166 struct net *net = dev_net(skb->dev);
1169 * Validate the packet.
1171 if (!pskb_may_pull(skb, sizeof(struct udphdr)))
1172 goto drop; /* No space for header. */
1174 ulen = ntohs(uh->len);
1175 if (ulen > skb->len)
1178 if (proto == IPPROTO_UDP) {
1179 /* UDP validates ulen. */
1180 if (ulen < sizeof(*uh) || pskb_trim_rcsum(skb, ulen))
1185 if (udp4_csum_init(skb, uh, proto))
1188 if (rt->rt_flags & (RTCF_BROADCAST|RTCF_MULTICAST))
1189 return __udp4_lib_mcast_deliver(net, skb, uh,
1190 saddr, daddr, udptable);
1192 sk = __udp4_lib_lookup(net, saddr, uh->source, daddr,
1193 uh->dest, inet_iif(skb), udptable);
1197 bh_lock_sock_nested(sk);
1198 if (!sock_owned_by_user(sk))
1199 ret = udp_queue_rcv_skb(sk, skb);
1201 sk_add_backlog(sk, skb);
1205 /* a return value > 0 means to resubmit the input, but
1206 * it wants the return to be -protocol, or 0
1213 if (!xfrm4_policy_check(NULL, XFRM_POLICY_IN, skb))
1217 /* No socket. Drop packet silently, if checksum is wrong */
1218 if (udp_lib_checksum_complete(skb))
1221 UDP_INC_STATS_BH(net, UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE);
1222 icmp_send(skb, ICMP_DEST_UNREACH, ICMP_PORT_UNREACH, 0);
1225 * Hmm. We got an UDP packet to a port to which we
1226 * don't wanna listen. Ignore it.
1232 LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: short packet: From " NIPQUAD_FMT ":%u %d/%d to " NIPQUAD_FMT ":%u\n",
1233 proto == IPPROTO_UDPLITE ? "-Lite" : "",
1244 * RFC1122: OK. Discards the bad packet silently (as far as
1245 * the network is concerned, anyway) as per 4.1.3.4 (MUST).
1247 LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: bad checksum. From " NIPQUAD_FMT ":%u to " NIPQUAD_FMT ":%u ulen %d\n",
1248 proto == IPPROTO_UDPLITE ? "-Lite" : "",
1255 UDP_INC_STATS_BH(net, UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE);
1260 int udp_rcv(struct sk_buff *skb)
1262 return __udp4_lib_rcv(skb, udp_hash, IPPROTO_UDP);
1265 void udp_destroy_sock(struct sock *sk)
1268 udp_flush_pending_frames(sk);
1273 * Socket option code for UDP
1275 int udp_lib_setsockopt(struct sock *sk, int level, int optname,
1276 char __user *optval, int optlen,
1277 int (*push_pending_frames)(struct sock *))
1279 struct udp_sock *up = udp_sk(sk);
1282 int is_udplite = IS_UDPLITE(sk);
1284 if (optlen<sizeof(int))
1287 if (get_user(val, (int __user *)optval))
1297 (*push_pending_frames)(sk);
1305 case UDP_ENCAP_ESPINUDP:
1306 case UDP_ENCAP_ESPINUDP_NON_IKE:
1307 up->encap_rcv = xfrm4_udp_encap_rcv;
1309 case UDP_ENCAP_L2TPINUDP:
1310 up->encap_type = val;
1319 * UDP-Lite's partial checksum coverage (RFC 3828).
1321 /* The sender sets actual checksum coverage length via this option.
1322 * The case coverage > packet length is handled by send module. */
1323 case UDPLITE_SEND_CSCOV:
1324 if (!is_udplite) /* Disable the option on UDP sockets */
1325 return -ENOPROTOOPT;
1326 if (val != 0 && val < 8) /* Illegal coverage: use default (8) */
1329 up->pcflag |= UDPLITE_SEND_CC;
1332 /* The receiver specifies a minimum checksum coverage value. To make
1333 * sense, this should be set to at least 8 (as done below). If zero is
1334 * used, this again means full checksum coverage. */
1335 case UDPLITE_RECV_CSCOV:
1336 if (!is_udplite) /* Disable the option on UDP sockets */
1337 return -ENOPROTOOPT;
1338 if (val != 0 && val < 8) /* Avoid silly minimal values. */
1341 up->pcflag |= UDPLITE_RECV_CC;
1352 int udp_setsockopt(struct sock *sk, int level, int optname,
1353 char __user *optval, int optlen)
1355 if (level == SOL_UDP || level == SOL_UDPLITE)
1356 return udp_lib_setsockopt(sk, level, optname, optval, optlen,
1357 udp_push_pending_frames);
1358 return ip_setsockopt(sk, level, optname, optval, optlen);
1361 #ifdef CONFIG_COMPAT
1362 int compat_udp_setsockopt(struct sock *sk, int level, int optname,
1363 char __user *optval, int optlen)
1365 if (level == SOL_UDP || level == SOL_UDPLITE)
1366 return udp_lib_setsockopt(sk, level, optname, optval, optlen,
1367 udp_push_pending_frames);
1368 return compat_ip_setsockopt(sk, level, optname, optval, optlen);
1372 int udp_lib_getsockopt(struct sock *sk, int level, int optname,
1373 char __user *optval, int __user *optlen)
1375 struct udp_sock *up = udp_sk(sk);
1378 if (get_user(len,optlen))
1381 len = min_t(unsigned int, len, sizeof(int));
1392 val = up->encap_type;
1395 /* The following two cannot be changed on UDP sockets, the return is
1396 * always 0 (which corresponds to the full checksum coverage of UDP). */
1397 case UDPLITE_SEND_CSCOV:
1401 case UDPLITE_RECV_CSCOV:
1406 return -ENOPROTOOPT;
1409 if (put_user(len, optlen))
1411 if (copy_to_user(optval, &val,len))
1416 int udp_getsockopt(struct sock *sk, int level, int optname,
1417 char __user *optval, int __user *optlen)
1419 if (level == SOL_UDP || level == SOL_UDPLITE)
1420 return udp_lib_getsockopt(sk, level, optname, optval, optlen);
1421 return ip_getsockopt(sk, level, optname, optval, optlen);
1424 #ifdef CONFIG_COMPAT
1425 int compat_udp_getsockopt(struct sock *sk, int level, int optname,
1426 char __user *optval, int __user *optlen)
1428 if (level == SOL_UDP || level == SOL_UDPLITE)
1429 return udp_lib_getsockopt(sk, level, optname, optval, optlen);
1430 return compat_ip_getsockopt(sk, level, optname, optval, optlen);
1434 * udp_poll - wait for a UDP event.
1435 * @file - file struct
1437 * @wait - poll table
1439 * This is same as datagram poll, except for the special case of
1440 * blocking sockets. If application is using a blocking fd
1441 * and a packet with checksum error is in the queue;
1442 * then it could get return from select indicating data available
1443 * but then block when reading it. Add special case code
1444 * to work around these arguably broken applications.
1446 unsigned int udp_poll(struct file *file, struct socket *sock, poll_table *wait)
1448 unsigned int mask = datagram_poll(file, sock, wait);
1449 struct sock *sk = sock->sk;
1450 int is_lite = IS_UDPLITE(sk);
1452 /* Check for false positives due to checksum errors */
1453 if ( (mask & POLLRDNORM) &&
1454 !(file->f_flags & O_NONBLOCK) &&
1455 !(sk->sk_shutdown & RCV_SHUTDOWN)){
1456 struct sk_buff_head *rcvq = &sk->sk_receive_queue;
1457 struct sk_buff *skb;
1459 spin_lock_bh(&rcvq->lock);
1460 while ((skb = skb_peek(rcvq)) != NULL &&
1461 udp_lib_checksum_complete(skb)) {
1462 UDP_INC_STATS_BH(sock_net(sk),
1463 UDP_MIB_INERRORS, is_lite);
1464 __skb_unlink(skb, rcvq);
1467 spin_unlock_bh(&rcvq->lock);
1469 /* nothing to see, move along */
1471 mask &= ~(POLLIN | POLLRDNORM);
1478 struct proto udp_prot = {
1480 .owner = THIS_MODULE,
1481 .close = udp_lib_close,
1482 .connect = ip4_datagram_connect,
1483 .disconnect = udp_disconnect,
1485 .destroy = udp_destroy_sock,
1486 .setsockopt = udp_setsockopt,
1487 .getsockopt = udp_getsockopt,
1488 .sendmsg = udp_sendmsg,
1489 .recvmsg = udp_recvmsg,
1490 .sendpage = udp_sendpage,
1491 .backlog_rcv = udp_queue_rcv_skb,
1492 .hash = udp_lib_hash,
1493 .unhash = udp_lib_unhash,
1494 .get_port = udp_v4_get_port,
1495 .memory_allocated = &udp_memory_allocated,
1496 .sysctl_mem = sysctl_udp_mem,
1497 .sysctl_wmem = &sysctl_udp_wmem_min,
1498 .sysctl_rmem = &sysctl_udp_rmem_min,
1499 .obj_size = sizeof(struct udp_sock),
1500 .h.udp_hash = udp_hash,
1501 #ifdef CONFIG_COMPAT
1502 .compat_setsockopt = compat_udp_setsockopt,
1503 .compat_getsockopt = compat_udp_getsockopt,
1507 /* ------------------------------------------------------------------------ */
1508 #ifdef CONFIG_PROC_FS
1510 static struct sock *udp_get_first(struct seq_file *seq)
1513 struct udp_iter_state *state = seq->private;
1514 struct net *net = seq_file_net(seq);
1516 for (state->bucket = 0; state->bucket < UDP_HTABLE_SIZE; ++state->bucket) {
1517 struct hlist_node *node;
1518 sk_for_each(sk, node, state->hashtable + state->bucket) {
1519 if (!net_eq(sock_net(sk), net))
1521 if (sk->sk_family == state->family)
1530 static struct sock *udp_get_next(struct seq_file *seq, struct sock *sk)
1532 struct udp_iter_state *state = seq->private;
1533 struct net *net = seq_file_net(seq);
1539 } while (sk && (!net_eq(sock_net(sk), net) || sk->sk_family != state->family));
1541 if (!sk && ++state->bucket < UDP_HTABLE_SIZE) {
1542 sk = sk_head(state->hashtable + state->bucket);
1548 static struct sock *udp_get_idx(struct seq_file *seq, loff_t pos)
1550 struct sock *sk = udp_get_first(seq);
1553 while (pos && (sk = udp_get_next(seq, sk)) != NULL)
1555 return pos ? NULL : sk;
1558 static void *udp_seq_start(struct seq_file *seq, loff_t *pos)
1559 __acquires(udp_hash_lock)
1561 read_lock(&udp_hash_lock);
1562 return *pos ? udp_get_idx(seq, *pos-1) : SEQ_START_TOKEN;
1565 static void *udp_seq_next(struct seq_file *seq, void *v, loff_t *pos)
1569 if (v == SEQ_START_TOKEN)
1570 sk = udp_get_idx(seq, 0);
1572 sk = udp_get_next(seq, v);
1578 static void udp_seq_stop(struct seq_file *seq, void *v)
1579 __releases(udp_hash_lock)
1581 read_unlock(&udp_hash_lock);
1584 static int udp_seq_open(struct inode *inode, struct file *file)
1586 struct udp_seq_afinfo *afinfo = PDE(inode)->data;
1587 struct udp_iter_state *s;
1590 err = seq_open_net(inode, file, &afinfo->seq_ops,
1591 sizeof(struct udp_iter_state));
1595 s = ((struct seq_file *)file->private_data)->private;
1596 s->family = afinfo->family;
1597 s->hashtable = afinfo->hashtable;
1601 /* ------------------------------------------------------------------------ */
1602 int udp_proc_register(struct net *net, struct udp_seq_afinfo *afinfo)
1604 struct proc_dir_entry *p;
1607 afinfo->seq_fops.open = udp_seq_open;
1608 afinfo->seq_fops.read = seq_read;
1609 afinfo->seq_fops.llseek = seq_lseek;
1610 afinfo->seq_fops.release = seq_release_net;
1612 afinfo->seq_ops.start = udp_seq_start;
1613 afinfo->seq_ops.next = udp_seq_next;
1614 afinfo->seq_ops.stop = udp_seq_stop;
1616 p = proc_create_data(afinfo->name, S_IRUGO, net->proc_net,
1617 &afinfo->seq_fops, afinfo);
1623 void udp_proc_unregister(struct net *net, struct udp_seq_afinfo *afinfo)
1625 proc_net_remove(net, afinfo->name);
1628 /* ------------------------------------------------------------------------ */
1629 static void udp4_format_sock(struct sock *sp, struct seq_file *f,
1630 int bucket, int *len)
1632 struct inet_sock *inet = inet_sk(sp);
1633 __be32 dest = inet->daddr;
1634 __be32 src = inet->rcv_saddr;
1635 __u16 destp = ntohs(inet->dport);
1636 __u16 srcp = ntohs(inet->sport);
1638 seq_printf(f, "%4d: %08X:%04X %08X:%04X"
1639 " %02X %08X:%08X %02X:%08lX %08X %5d %8d %lu %d %p %d%n",
1640 bucket, src, srcp, dest, destp, sp->sk_state,
1641 atomic_read(&sp->sk_wmem_alloc),
1642 atomic_read(&sp->sk_rmem_alloc),
1643 0, 0L, 0, sock_i_uid(sp), 0, sock_i_ino(sp),
1644 atomic_read(&sp->sk_refcnt), sp,
1645 atomic_read(&sp->sk_drops), len);
1648 int udp4_seq_show(struct seq_file *seq, void *v)
1650 if (v == SEQ_START_TOKEN)
1651 seq_printf(seq, "%-127s\n",
1652 " sl local_address rem_address st tx_queue "
1653 "rx_queue tr tm->when retrnsmt uid timeout "
1654 "inode ref pointer drops");
1656 struct udp_iter_state *state = seq->private;
1659 udp4_format_sock(v, seq, state->bucket, &len);
1660 seq_printf(seq, "%*s\n", 127 - len ,"");
1665 /* ------------------------------------------------------------------------ */
1666 static struct udp_seq_afinfo udp4_seq_afinfo = {
1669 .hashtable = udp_hash,
1671 .owner = THIS_MODULE,
1674 .show = udp4_seq_show,
1678 static int udp4_proc_init_net(struct net *net)
1680 return udp_proc_register(net, &udp4_seq_afinfo);
1683 static void udp4_proc_exit_net(struct net *net)
1685 udp_proc_unregister(net, &udp4_seq_afinfo);
1688 static struct pernet_operations udp4_net_ops = {
1689 .init = udp4_proc_init_net,
1690 .exit = udp4_proc_exit_net,
1693 int __init udp4_proc_init(void)
1695 return register_pernet_subsys(&udp4_net_ops);
1698 void udp4_proc_exit(void)
1700 unregister_pernet_subsys(&udp4_net_ops);
1702 #endif /* CONFIG_PROC_FS */
1704 void __init udp_init(void)
1706 unsigned long limit;
1708 /* Set the pressure threshold up by the same strategy of TCP. It is a
1709 * fraction of global memory that is up to 1/2 at 256 MB, decreasing
1710 * toward zero with the amount of memory, with a floor of 128 pages.
1712 limit = min(nr_all_pages, 1UL<<(28-PAGE_SHIFT)) >> (20-PAGE_SHIFT);
1713 limit = (limit * (nr_all_pages >> (20-PAGE_SHIFT))) >> (PAGE_SHIFT-11);
1714 limit = max(limit, 128UL);
1715 sysctl_udp_mem[0] = limit / 4 * 3;
1716 sysctl_udp_mem[1] = limit;
1717 sysctl_udp_mem[2] = sysctl_udp_mem[0] * 2;
1719 sysctl_udp_rmem_min = SK_MEM_QUANTUM;
1720 sysctl_udp_wmem_min = SK_MEM_QUANTUM;
1723 EXPORT_SYMBOL(udp_disconnect);
1724 EXPORT_SYMBOL(udp_hash);
1725 EXPORT_SYMBOL(udp_hash_lock);
1726 EXPORT_SYMBOL(udp_ioctl);
1727 EXPORT_SYMBOL(udp_prot);
1728 EXPORT_SYMBOL(udp_sendmsg);
1729 EXPORT_SYMBOL(udp_lib_getsockopt);
1730 EXPORT_SYMBOL(udp_lib_setsockopt);
1731 EXPORT_SYMBOL(udp_poll);
1732 EXPORT_SYMBOL(udp_lib_get_port);
1734 #ifdef CONFIG_PROC_FS
1735 EXPORT_SYMBOL(udp_proc_register);
1736 EXPORT_SYMBOL(udp_proc_unregister);