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_statistics
) __read_mostly
;
112 EXPORT_SYMBOL(udp_statistics
);
114 DEFINE_SNMP_STAT(struct udp_mib
, udp_stats_in6
) __read_mostly
;
115 EXPORT_SYMBOL(udp_stats_in6
);
117 struct hlist_head udp_hash
[UDP_HTABLE_SIZE
];
118 DEFINE_RWLOCK(udp_hash_lock
);
120 int sysctl_udp_mem
[3] __read_mostly
;
121 int sysctl_udp_rmem_min __read_mostly
;
122 int sysctl_udp_wmem_min __read_mostly
;
124 EXPORT_SYMBOL(sysctl_udp_mem
);
125 EXPORT_SYMBOL(sysctl_udp_rmem_min
);
126 EXPORT_SYMBOL(sysctl_udp_wmem_min
);
128 atomic_t udp_memory_allocated
;
129 EXPORT_SYMBOL(udp_memory_allocated
);
131 static inline int __udp_lib_lport_inuse(struct net
*net
, __u16 num
,
132 const struct hlist_head udptable
[])
135 struct hlist_node
*node
;
137 sk_for_each(sk
, node
, &udptable
[udp_hashfn(net
, num
)])
138 if (net_eq(sock_net(sk
), net
) && sk
->sk_hash
== num
)
144 * udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
146 * @sk: socket struct in question
147 * @snum: port number to look up
148 * @saddr_comp: AF-dependent comparison of bound local IP addresses
150 int udp_lib_get_port(struct sock
*sk
, unsigned short snum
,
151 int (*saddr_comp
)(const struct sock
*sk1
,
152 const struct sock
*sk2
) )
154 struct hlist_head
*udptable
= sk
->sk_prot
->h
.udp_hash
;
155 struct hlist_node
*node
;
156 struct hlist_head
*head
;
159 struct net
*net
= sock_net(sk
);
161 write_lock_bh(&udp_hash_lock
);
164 int i
, low
, high
, remaining
;
165 unsigned rover
, best
, best_size_so_far
;
167 inet_get_local_port_range(&low
, &high
);
168 remaining
= (high
- low
) + 1;
170 best_size_so_far
= UINT_MAX
;
171 best
= rover
= net_random() % remaining
+ low
;
173 /* 1st pass: look for empty (or shortest) hash chain */
174 for (i
= 0; i
< UDP_HTABLE_SIZE
; i
++) {
177 head
= &udptable
[udp_hashfn(net
, rover
)];
178 if (hlist_empty(head
))
181 sk_for_each(sk2
, node
, head
) {
182 if (++size
>= best_size_so_far
)
185 best_size_so_far
= size
;
188 /* fold back if end of range */
190 rover
= low
+ ((rover
- low
)
191 & (UDP_HTABLE_SIZE
- 1));
196 /* 2nd pass: find hole in shortest hash chain */
198 for (i
= 0; i
< (1 << 16) / UDP_HTABLE_SIZE
; i
++) {
199 if (! __udp_lib_lport_inuse(net
, rover
, udptable
))
201 rover
+= UDP_HTABLE_SIZE
;
203 rover
= low
+ ((rover
- low
)
204 & (UDP_HTABLE_SIZE
- 1));
208 /* All ports in use! */
214 head
= &udptable
[udp_hashfn(net
, snum
)];
216 sk_for_each(sk2
, node
, head
)
217 if (sk2
->sk_hash
== snum
&&
219 net_eq(sock_net(sk2
), net
) &&
220 (!sk2
->sk_reuse
|| !sk
->sk_reuse
) &&
221 (!sk2
->sk_bound_dev_if
|| !sk
->sk_bound_dev_if
222 || sk2
->sk_bound_dev_if
== sk
->sk_bound_dev_if
) &&
223 (*saddr_comp
)(sk
, sk2
) )
227 inet_sk(sk
)->num
= snum
;
229 if (sk_unhashed(sk
)) {
230 head
= &udptable
[udp_hashfn(net
, snum
)];
231 sk_add_node(sk
, head
);
232 sock_prot_inuse_add(sock_net(sk
), sk
->sk_prot
, 1);
236 write_unlock_bh(&udp_hash_lock
);
240 static int ipv4_rcv_saddr_equal(const struct sock
*sk1
, const struct sock
*sk2
)
242 struct inet_sock
*inet1
= inet_sk(sk1
), *inet2
= inet_sk(sk2
);
244 return ( !ipv6_only_sock(sk2
) &&
245 (!inet1
->rcv_saddr
|| !inet2
->rcv_saddr
||
246 inet1
->rcv_saddr
== inet2
->rcv_saddr
));
249 int udp_v4_get_port(struct sock
*sk
, unsigned short snum
)
251 return udp_lib_get_port(sk
, snum
, ipv4_rcv_saddr_equal
);
254 /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
255 * harder than this. -DaveM
257 static struct sock
*__udp4_lib_lookup(struct net
*net
, __be32 saddr
,
258 __be16 sport
, __be32 daddr
, __be16 dport
,
259 int dif
, struct hlist_head udptable
[])
261 struct sock
*sk
, *result
= NULL
;
262 struct hlist_node
*node
;
263 unsigned short hnum
= ntohs(dport
);
266 read_lock(&udp_hash_lock
);
267 sk_for_each(sk
, node
, &udptable
[udp_hashfn(net
, hnum
)]) {
268 struct inet_sock
*inet
= inet_sk(sk
);
270 if (net_eq(sock_net(sk
), net
) && sk
->sk_hash
== hnum
&&
271 !ipv6_only_sock(sk
)) {
272 int score
= (sk
->sk_family
== PF_INET
? 1 : 0);
273 if (inet
->rcv_saddr
) {
274 if (inet
->rcv_saddr
!= daddr
)
279 if (inet
->daddr
!= saddr
)
284 if (inet
->dport
!= sport
)
288 if (sk
->sk_bound_dev_if
) {
289 if (sk
->sk_bound_dev_if
!= dif
)
296 } else if (score
> badness
) {
304 read_unlock(&udp_hash_lock
);
308 static inline struct sock
*udp_v4_mcast_next(struct sock
*sk
,
309 __be16 loc_port
, __be32 loc_addr
,
310 __be16 rmt_port
, __be32 rmt_addr
,
313 struct hlist_node
*node
;
315 unsigned short hnum
= ntohs(loc_port
);
317 sk_for_each_from(s
, node
) {
318 struct inet_sock
*inet
= inet_sk(s
);
320 if (s
->sk_hash
!= hnum
||
321 (inet
->daddr
&& inet
->daddr
!= rmt_addr
) ||
322 (inet
->dport
!= rmt_port
&& inet
->dport
) ||
323 (inet
->rcv_saddr
&& inet
->rcv_saddr
!= loc_addr
) ||
325 (s
->sk_bound_dev_if
&& s
->sk_bound_dev_if
!= dif
))
327 if (!ip_mc_sf_allow(s
, loc_addr
, rmt_addr
, dif
))
337 * This routine is called by the ICMP module when it gets some
338 * sort of error condition. If err < 0 then the socket should
339 * be closed and the error returned to the user. If err > 0
340 * it's just the icmp type << 8 | icmp code.
341 * Header points to the ip header of the error packet. We move
342 * on past this. Then (as it used to claim before adjustment)
343 * header points to the first 8 bytes of the udp header. We need
344 * to find the appropriate port.
347 void __udp4_lib_err(struct sk_buff
*skb
, u32 info
, struct hlist_head udptable
[])
349 struct inet_sock
*inet
;
350 struct iphdr
*iph
= (struct iphdr
*)skb
->data
;
351 struct udphdr
*uh
= (struct udphdr
*)(skb
->data
+(iph
->ihl
<<2));
352 const int type
= icmp_hdr(skb
)->type
;
353 const int code
= icmp_hdr(skb
)->code
;
358 sk
= __udp4_lib_lookup(dev_net(skb
->dev
), iph
->daddr
, uh
->dest
,
359 iph
->saddr
, uh
->source
, skb
->dev
->ifindex
, udptable
);
361 ICMP_INC_STATS_BH(ICMP_MIB_INERRORS
);
362 return; /* No socket for error */
371 case ICMP_TIME_EXCEEDED
:
374 case ICMP_SOURCE_QUENCH
:
376 case ICMP_PARAMETERPROB
:
380 case ICMP_DEST_UNREACH
:
381 if (code
== ICMP_FRAG_NEEDED
) { /* Path MTU discovery */
382 if (inet
->pmtudisc
!= IP_PMTUDISC_DONT
) {
390 if (code
<= NR_ICMP_UNREACH
) {
391 harderr
= icmp_err_convert
[code
].fatal
;
392 err
= icmp_err_convert
[code
].errno
;
398 * RFC1122: OK. Passes ICMP errors back to application, as per
401 if (!inet
->recverr
) {
402 if (!harderr
|| sk
->sk_state
!= TCP_ESTABLISHED
)
405 ip_icmp_error(sk
, skb
, err
, uh
->dest
, info
, (u8
*)(uh
+1));
408 sk
->sk_error_report(sk
);
413 void udp_err(struct sk_buff
*skb
, u32 info
)
415 __udp4_lib_err(skb
, info
, udp_hash
);
419 * Throw away all pending data and cancel the corking. Socket is locked.
421 void udp_flush_pending_frames(struct sock
*sk
)
423 struct udp_sock
*up
= udp_sk(sk
);
428 ip_flush_pending_frames(sk
);
431 EXPORT_SYMBOL(udp_flush_pending_frames
);
434 * udp4_hwcsum_outgoing - handle outgoing HW checksumming
435 * @sk: socket we are sending on
436 * @skb: sk_buff containing the filled-in UDP header
437 * (checksum field must be zeroed out)
439 static void udp4_hwcsum_outgoing(struct sock
*sk
, struct sk_buff
*skb
,
440 __be32 src
, __be32 dst
, int len
)
443 struct udphdr
*uh
= udp_hdr(skb
);
446 if (skb_queue_len(&sk
->sk_write_queue
) == 1) {
448 * Only one fragment on the socket.
450 skb
->csum_start
= skb_transport_header(skb
) - skb
->head
;
451 skb
->csum_offset
= offsetof(struct udphdr
, check
);
452 uh
->check
= ~csum_tcpudp_magic(src
, dst
, len
, IPPROTO_UDP
, 0);
455 * HW-checksum won't work as there are two or more
456 * fragments on the socket so that all csums of sk_buffs
459 offset
= skb_transport_offset(skb
);
460 skb
->csum
= skb_checksum(skb
, offset
, skb
->len
- offset
, 0);
462 skb
->ip_summed
= CHECKSUM_NONE
;
464 skb_queue_walk(&sk
->sk_write_queue
, skb
) {
465 csum
= csum_add(csum
, skb
->csum
);
468 uh
->check
= csum_tcpudp_magic(src
, dst
, len
, IPPROTO_UDP
, csum
);
470 uh
->check
= CSUM_MANGLED_0
;
475 * Push out all pending data as one UDP datagram. Socket is locked.
477 static int udp_push_pending_frames(struct sock
*sk
)
479 struct udp_sock
*up
= udp_sk(sk
);
480 struct inet_sock
*inet
= inet_sk(sk
);
481 struct flowi
*fl
= &inet
->cork
.fl
;
485 int is_udplite
= IS_UDPLITE(sk
);
488 /* Grab the skbuff where UDP header space exists. */
489 if ((skb
= skb_peek(&sk
->sk_write_queue
)) == NULL
)
493 * Create a UDP header
496 uh
->source
= fl
->fl_ip_sport
;
497 uh
->dest
= fl
->fl_ip_dport
;
498 uh
->len
= htons(up
->len
);
501 if (is_udplite
) /* UDP-Lite */
502 csum
= udplite_csum_outgoing(sk
, skb
);
504 else if (sk
->sk_no_check
== UDP_CSUM_NOXMIT
) { /* UDP csum disabled */
506 skb
->ip_summed
= CHECKSUM_NONE
;
509 } else if (skb
->ip_summed
== CHECKSUM_PARTIAL
) { /* UDP hardware csum */
511 udp4_hwcsum_outgoing(sk
, skb
, fl
->fl4_src
,fl
->fl4_dst
, up
->len
);
514 } else /* `normal' UDP */
515 csum
= udp_csum_outgoing(sk
, skb
);
517 /* add protocol-dependent pseudo-header */
518 uh
->check
= csum_tcpudp_magic(fl
->fl4_src
, fl
->fl4_dst
, up
->len
,
519 sk
->sk_protocol
, csum
);
521 uh
->check
= CSUM_MANGLED_0
;
524 err
= ip_push_pending_frames(sk
);
529 UDP_INC_STATS_USER(UDP_MIB_OUTDATAGRAMS
, is_udplite
);
533 int udp_sendmsg(struct kiocb
*iocb
, struct sock
*sk
, struct msghdr
*msg
,
536 struct inet_sock
*inet
= inet_sk(sk
);
537 struct udp_sock
*up
= udp_sk(sk
);
539 struct ipcm_cookie ipc
;
540 struct rtable
*rt
= NULL
;
543 __be32 daddr
, faddr
, saddr
;
546 int err
, is_udplite
= IS_UDPLITE(sk
);
547 int corkreq
= up
->corkflag
|| msg
->msg_flags
&MSG_MORE
;
548 int (*getfrag
)(void *, char *, int, int, int, struct sk_buff
*);
557 if (msg
->msg_flags
&MSG_OOB
) /* Mirror BSD error message compatibility */
564 * There are pending frames.
565 * The socket lock must be held while it's corked.
568 if (likely(up
->pending
)) {
569 if (unlikely(up
->pending
!= AF_INET
)) {
577 ulen
+= sizeof(struct udphdr
);
580 * Get and verify the address.
583 struct sockaddr_in
* usin
= (struct sockaddr_in
*)msg
->msg_name
;
584 if (msg
->msg_namelen
< sizeof(*usin
))
586 if (usin
->sin_family
!= AF_INET
) {
587 if (usin
->sin_family
!= AF_UNSPEC
)
588 return -EAFNOSUPPORT
;
591 daddr
= usin
->sin_addr
.s_addr
;
592 dport
= usin
->sin_port
;
596 if (sk
->sk_state
!= TCP_ESTABLISHED
)
597 return -EDESTADDRREQ
;
600 /* Open fast path for connected socket.
601 Route will not be used, if at least one option is set.
605 ipc
.addr
= inet
->saddr
;
607 ipc
.oif
= sk
->sk_bound_dev_if
;
608 if (msg
->msg_controllen
) {
609 err
= ip_cmsg_send(sock_net(sk
), msg
, &ipc
);
620 ipc
.addr
= faddr
= daddr
;
622 if (ipc
.opt
&& ipc
.opt
->srr
) {
625 faddr
= ipc
.opt
->faddr
;
628 tos
= RT_TOS(inet
->tos
);
629 if (sock_flag(sk
, SOCK_LOCALROUTE
) ||
630 (msg
->msg_flags
& MSG_DONTROUTE
) ||
631 (ipc
.opt
&& ipc
.opt
->is_strictroute
)) {
636 if (ipv4_is_multicast(daddr
)) {
638 ipc
.oif
= inet
->mc_index
;
640 saddr
= inet
->mc_addr
;
645 rt
= (struct rtable
*)sk_dst_check(sk
, 0);
648 struct flowi fl
= { .oif
= ipc
.oif
,
653 .proto
= sk
->sk_protocol
,
655 { .sport
= inet
->sport
,
656 .dport
= dport
} } };
657 security_sk_classify_flow(sk
, &fl
);
658 err
= ip_route_output_flow(sock_net(sk
), &rt
, &fl
, sk
, 1);
660 if (err
== -ENETUNREACH
)
661 IP_INC_STATS_BH(IPSTATS_MIB_OUTNOROUTES
);
666 if ((rt
->rt_flags
& RTCF_BROADCAST
) &&
667 !sock_flag(sk
, SOCK_BROADCAST
))
670 sk_dst_set(sk
, dst_clone(&rt
->u
.dst
));
673 if (msg
->msg_flags
&MSG_CONFIRM
)
679 daddr
= ipc
.addr
= rt
->rt_dst
;
682 if (unlikely(up
->pending
)) {
683 /* The socket is already corked while preparing it. */
684 /* ... which is an evident application bug. --ANK */
687 LIMIT_NETDEBUG(KERN_DEBUG
"udp cork app bug 2\n");
692 * Now cork the socket to pend data.
694 inet
->cork
.fl
.fl4_dst
= daddr
;
695 inet
->cork
.fl
.fl_ip_dport
= dport
;
696 inet
->cork
.fl
.fl4_src
= saddr
;
697 inet
->cork
.fl
.fl_ip_sport
= inet
->sport
;
698 up
->pending
= AF_INET
;
702 getfrag
= is_udplite
? udplite_getfrag
: ip_generic_getfrag
;
703 err
= ip_append_data(sk
, getfrag
, msg
->msg_iov
, ulen
,
704 sizeof(struct udphdr
), &ipc
, rt
,
705 corkreq
? msg
->msg_flags
|MSG_MORE
: msg
->msg_flags
);
707 udp_flush_pending_frames(sk
);
709 err
= udp_push_pending_frames(sk
);
710 else if (unlikely(skb_queue_empty(&sk
->sk_write_queue
)))
721 * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
722 * ENOBUFS might not be good (it's not tunable per se), but otherwise
723 * we don't have a good statistic (IpOutDiscards but it can be too many
724 * things). We could add another new stat but at least for now that
725 * seems like overkill.
727 if (err
== -ENOBUFS
|| test_bit(SOCK_NOSPACE
, &sk
->sk_socket
->flags
)) {
728 UDP_INC_STATS_USER(UDP_MIB_SNDBUFERRORS
, is_udplite
);
733 dst_confirm(&rt
->u
.dst
);
734 if (!(msg
->msg_flags
&MSG_PROBE
) || len
)
735 goto back_from_confirm
;
740 int udp_sendpage(struct sock
*sk
, struct page
*page
, int offset
,
741 size_t size
, int flags
)
743 struct udp_sock
*up
= udp_sk(sk
);
747 struct msghdr msg
= { .msg_flags
= flags
|MSG_MORE
};
749 /* Call udp_sendmsg to specify destination address which
750 * sendpage interface can't pass.
751 * This will succeed only when the socket is connected.
753 ret
= udp_sendmsg(NULL
, sk
, &msg
, 0);
760 if (unlikely(!up
->pending
)) {
763 LIMIT_NETDEBUG(KERN_DEBUG
"udp cork app bug 3\n");
767 ret
= ip_append_page(sk
, page
, offset
, size
, flags
);
768 if (ret
== -EOPNOTSUPP
) {
770 return sock_no_sendpage(sk
->sk_socket
, page
, offset
,
774 udp_flush_pending_frames(sk
);
779 if (!(up
->corkflag
|| (flags
&MSG_MORE
)))
780 ret
= udp_push_pending_frames(sk
);
789 * IOCTL requests applicable to the UDP protocol
792 int udp_ioctl(struct sock
*sk
, int cmd
, unsigned long arg
)
797 int amount
= atomic_read(&sk
->sk_wmem_alloc
);
798 return put_user(amount
, (int __user
*)arg
);
804 unsigned long amount
;
807 spin_lock_bh(&sk
->sk_receive_queue
.lock
);
808 skb
= skb_peek(&sk
->sk_receive_queue
);
811 * We will only return the amount
812 * of this packet since that is all
815 amount
= skb
->len
- sizeof(struct udphdr
);
817 spin_unlock_bh(&sk
->sk_receive_queue
.lock
);
818 return put_user(amount
, (int __user
*)arg
);
829 * This should be easy, if there is something there we
830 * return it, otherwise we block.
833 int udp_recvmsg(struct kiocb
*iocb
, struct sock
*sk
, struct msghdr
*msg
,
834 size_t len
, int noblock
, int flags
, int *addr_len
)
836 struct inet_sock
*inet
= inet_sk(sk
);
837 struct sockaddr_in
*sin
= (struct sockaddr_in
*)msg
->msg_name
;
839 unsigned int ulen
, copied
;
842 int is_udplite
= IS_UDPLITE(sk
);
845 * Check any passed addresses
848 *addr_len
=sizeof(*sin
);
850 if (flags
& MSG_ERRQUEUE
)
851 return ip_recv_error(sk
, msg
, len
);
854 skb
= __skb_recv_datagram(sk
, flags
| (noblock
? MSG_DONTWAIT
: 0),
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
);
891 UDP_INC_STATS_USER(UDP_MIB_INDATAGRAMS
, is_udplite
);
893 sock_recv_timestamp(msg
, sk
, skb
);
895 /* Copy the address. */
898 sin
->sin_family
= AF_INET
;
899 sin
->sin_port
= udp_hdr(skb
)->source
;
900 sin
->sin_addr
.s_addr
= ip_hdr(skb
)->saddr
;
901 memset(sin
->sin_zero
, 0, sizeof(sin
->sin_zero
));
903 if (inet
->cmsg_flags
)
904 ip_cmsg_recv(msg
, skb
);
907 if (flags
& MSG_TRUNC
)
912 skb_free_datagram(sk
, skb
);
919 if (!skb_kill_datagram(sk
, skb
, flags
))
920 UDP_INC_STATS_USER(UDP_MIB_INERRORS
, is_udplite
);
929 int udp_disconnect(struct sock
*sk
, int flags
)
931 struct inet_sock
*inet
= inet_sk(sk
);
933 * 1003.1g - break association.
936 sk
->sk_state
= TCP_CLOSE
;
939 sk
->sk_bound_dev_if
= 0;
940 if (!(sk
->sk_userlocks
& SOCK_BINDADDR_LOCK
))
941 inet_reset_saddr(sk
);
943 if (!(sk
->sk_userlocks
& SOCK_BINDPORT_LOCK
)) {
944 sk
->sk_prot
->unhash(sk
);
954 * >0: "udp encap" protocol resubmission
956 * Note that in the success and error cases, the skb is assumed to
957 * have either been requeued or freed.
959 int udp_queue_rcv_skb(struct sock
* sk
, struct sk_buff
*skb
)
961 struct udp_sock
*up
= udp_sk(sk
);
963 int is_udplite
= IS_UDPLITE(sk
);
966 * Charge it to the socket, dropping if the queue is full.
968 if (!xfrm4_policy_check(sk
, XFRM_POLICY_IN
, skb
))
972 if (up
->encap_type
) {
974 * This is an encapsulation socket so pass the skb to
975 * the socket's udp_encap_rcv() hook. Otherwise, just
976 * fall through and pass this up the UDP socket.
977 * up->encap_rcv() returns the following value:
978 * =0 if skb was successfully passed to the encap
979 * handler or was discarded by it.
980 * >0 if skb should be passed on to UDP.
981 * <0 if skb should be resubmitted as proto -N
984 /* if we're overly short, let UDP handle it */
985 if (skb
->len
> sizeof(struct udphdr
) &&
986 up
->encap_rcv
!= NULL
) {
989 ret
= (*up
->encap_rcv
)(sk
, skb
);
991 UDP_INC_STATS_BH(UDP_MIB_INDATAGRAMS
,
997 /* FALLTHROUGH -- it's a UDP Packet */
1001 * UDP-Lite specific tests, ignored on UDP sockets
1003 if ((is_udplite
& UDPLITE_RECV_CC
) && UDP_SKB_CB(skb
)->partial_cov
) {
1006 * MIB statistics other than incrementing the error count are
1007 * disabled for the following two types of errors: these depend
1008 * on the application settings, not on the functioning of the
1009 * protocol stack as such.
1011 * RFC 3828 here recommends (sec 3.3): "There should also be a
1012 * way ... to ... at least let the receiving application block
1013 * delivery of packets with coverage values less than a value
1014 * provided by the application."
1016 if (up
->pcrlen
== 0) { /* full coverage was set */
1017 LIMIT_NETDEBUG(KERN_WARNING
"UDPLITE: partial coverage "
1018 "%d while full coverage %d requested\n",
1019 UDP_SKB_CB(skb
)->cscov
, skb
->len
);
1022 /* The next case involves violating the min. coverage requested
1023 * by the receiver. This is subtle: if receiver wants x and x is
1024 * greater than the buffersize/MTU then receiver will complain
1025 * that it wants x while sender emits packets of smaller size y.
1026 * Therefore the above ...()->partial_cov statement is essential.
1028 if (UDP_SKB_CB(skb
)->cscov
< up
->pcrlen
) {
1029 LIMIT_NETDEBUG(KERN_WARNING
1030 "UDPLITE: coverage %d too small, need min %d\n",
1031 UDP_SKB_CB(skb
)->cscov
, up
->pcrlen
);
1036 if (sk
->sk_filter
) {
1037 if (udp_lib_checksum_complete(skb
))
1041 if ((rc
= sock_queue_rcv_skb(sk
,skb
)) < 0) {
1042 /* Note that an ENOMEM error is charged twice */
1043 if (rc
== -ENOMEM
) {
1044 UDP_INC_STATS_BH(UDP_MIB_RCVBUFERRORS
, is_udplite
);
1045 atomic_inc(&sk
->sk_drops
);
1053 UDP_INC_STATS_BH(UDP_MIB_INERRORS
, is_udplite
);
1059 * Multicasts and broadcasts go to each listener.
1061 * Note: called only from the BH handler context,
1062 * so we don't need to lock the hashes.
1064 static int __udp4_lib_mcast_deliver(struct net
*net
, struct sk_buff
*skb
,
1066 __be32 saddr
, __be32 daddr
,
1067 struct hlist_head udptable
[])
1072 read_lock(&udp_hash_lock
);
1073 sk
= sk_head(&udptable
[udp_hashfn(net
, ntohs(uh
->dest
))]);
1074 dif
= skb
->dev
->ifindex
;
1075 sk
= udp_v4_mcast_next(sk
, uh
->dest
, daddr
, uh
->source
, saddr
, dif
);
1077 struct sock
*sknext
= NULL
;
1080 struct sk_buff
*skb1
= skb
;
1082 sknext
= udp_v4_mcast_next(sk_next(sk
), uh
->dest
, daddr
,
1083 uh
->source
, saddr
, dif
);
1085 skb1
= skb_clone(skb
, GFP_ATOMIC
);
1090 bh_lock_sock_nested(sk
);
1091 if (!sock_owned_by_user(sk
))
1092 ret
= udp_queue_rcv_skb(sk
, skb1
);
1094 sk_add_backlog(sk
, skb1
);
1098 /* we should probably re-process instead
1099 * of dropping packets here. */
1106 read_unlock(&udp_hash_lock
);
1110 /* Initialize UDP checksum. If exited with zero value (success),
1111 * CHECKSUM_UNNECESSARY means, that no more checks are required.
1112 * Otherwise, csum completion requires chacksumming packet body,
1113 * including udp header and folding it to skb->csum.
1115 static inline int udp4_csum_init(struct sk_buff
*skb
, struct udphdr
*uh
,
1118 const struct iphdr
*iph
;
1121 UDP_SKB_CB(skb
)->partial_cov
= 0;
1122 UDP_SKB_CB(skb
)->cscov
= skb
->len
;
1124 if (proto
== IPPROTO_UDPLITE
) {
1125 err
= udplite_checksum_init(skb
, uh
);
1131 if (uh
->check
== 0) {
1132 skb
->ip_summed
= CHECKSUM_UNNECESSARY
;
1133 } else if (skb
->ip_summed
== CHECKSUM_COMPLETE
) {
1134 if (!csum_tcpudp_magic(iph
->saddr
, iph
->daddr
, skb
->len
,
1136 skb
->ip_summed
= CHECKSUM_UNNECESSARY
;
1138 if (!skb_csum_unnecessary(skb
))
1139 skb
->csum
= csum_tcpudp_nofold(iph
->saddr
, iph
->daddr
,
1140 skb
->len
, proto
, 0);
1141 /* Probably, we should checksum udp header (it should be in cache
1142 * in any case) and data in tiny packets (< rx copybreak).
1149 * All we need to do is get the socket, and then do a checksum.
1152 int __udp4_lib_rcv(struct sk_buff
*skb
, struct hlist_head udptable
[],
1156 struct udphdr
*uh
= udp_hdr(skb
);
1157 unsigned short ulen
;
1158 struct rtable
*rt
= (struct rtable
*)skb
->dst
;
1159 __be32 saddr
= ip_hdr(skb
)->saddr
;
1160 __be32 daddr
= ip_hdr(skb
)->daddr
;
1164 * Validate the packet.
1166 if (!pskb_may_pull(skb
, sizeof(struct udphdr
)))
1167 goto drop
; /* No space for header. */
1169 ulen
= ntohs(uh
->len
);
1170 if (ulen
> skb
->len
)
1173 if (proto
== IPPROTO_UDP
) {
1174 /* UDP validates ulen. */
1175 if (ulen
< sizeof(*uh
) || pskb_trim_rcsum(skb
, ulen
))
1180 if (udp4_csum_init(skb
, uh
, proto
))
1183 net
= dev_net(skb
->dev
);
1184 if (rt
->rt_flags
& (RTCF_BROADCAST
|RTCF_MULTICAST
))
1185 return __udp4_lib_mcast_deliver(net
, skb
, uh
,
1186 saddr
, daddr
, udptable
);
1188 sk
= __udp4_lib_lookup(net
, saddr
, uh
->source
, daddr
,
1189 uh
->dest
, inet_iif(skb
), udptable
);
1193 bh_lock_sock_nested(sk
);
1194 if (!sock_owned_by_user(sk
))
1195 ret
= udp_queue_rcv_skb(sk
, skb
);
1197 sk_add_backlog(sk
, skb
);
1201 /* a return value > 0 means to resubmit the input, but
1202 * it wants the return to be -protocol, or 0
1209 if (!xfrm4_policy_check(NULL
, XFRM_POLICY_IN
, skb
))
1213 /* No socket. Drop packet silently, if checksum is wrong */
1214 if (udp_lib_checksum_complete(skb
))
1217 UDP_INC_STATS_BH(UDP_MIB_NOPORTS
, proto
== IPPROTO_UDPLITE
);
1218 icmp_send(skb
, ICMP_DEST_UNREACH
, ICMP_PORT_UNREACH
, 0);
1221 * Hmm. We got an UDP packet to a port to which we
1222 * don't wanna listen. Ignore it.
1228 LIMIT_NETDEBUG(KERN_DEBUG
"UDP%s: short packet: From " NIPQUAD_FMT
":%u %d/%d to " NIPQUAD_FMT
":%u\n",
1229 proto
== IPPROTO_UDPLITE
? "-Lite" : "",
1240 * RFC1122: OK. Discards the bad packet silently (as far as
1241 * the network is concerned, anyway) as per 4.1.3.4 (MUST).
1243 LIMIT_NETDEBUG(KERN_DEBUG
"UDP%s: bad checksum. From " NIPQUAD_FMT
":%u to " NIPQUAD_FMT
":%u ulen %d\n",
1244 proto
== IPPROTO_UDPLITE
? "-Lite" : "",
1251 UDP_INC_STATS_BH(UDP_MIB_INERRORS
, proto
== IPPROTO_UDPLITE
);
1256 int udp_rcv(struct sk_buff
*skb
)
1258 return __udp4_lib_rcv(skb
, udp_hash
, IPPROTO_UDP
);
1261 void udp_destroy_sock(struct sock
*sk
)
1264 udp_flush_pending_frames(sk
);
1269 * Socket option code for UDP
1271 int udp_lib_setsockopt(struct sock
*sk
, int level
, int optname
,
1272 char __user
*optval
, int optlen
,
1273 int (*push_pending_frames
)(struct sock
*))
1275 struct udp_sock
*up
= udp_sk(sk
);
1278 int is_udplite
= IS_UDPLITE(sk
);
1280 if (optlen
<sizeof(int))
1283 if (get_user(val
, (int __user
*)optval
))
1293 (*push_pending_frames
)(sk
);
1301 case UDP_ENCAP_ESPINUDP
:
1302 case UDP_ENCAP_ESPINUDP_NON_IKE
:
1303 up
->encap_rcv
= xfrm4_udp_encap_rcv
;
1305 case UDP_ENCAP_L2TPINUDP
:
1306 up
->encap_type
= val
;
1315 * UDP-Lite's partial checksum coverage (RFC 3828).
1317 /* The sender sets actual checksum coverage length via this option.
1318 * The case coverage > packet length is handled by send module. */
1319 case UDPLITE_SEND_CSCOV
:
1320 if (!is_udplite
) /* Disable the option on UDP sockets */
1321 return -ENOPROTOOPT
;
1322 if (val
!= 0 && val
< 8) /* Illegal coverage: use default (8) */
1325 up
->pcflag
|= UDPLITE_SEND_CC
;
1328 /* The receiver specifies a minimum checksum coverage value. To make
1329 * sense, this should be set to at least 8 (as done below). If zero is
1330 * used, this again means full checksum coverage. */
1331 case UDPLITE_RECV_CSCOV
:
1332 if (!is_udplite
) /* Disable the option on UDP sockets */
1333 return -ENOPROTOOPT
;
1334 if (val
!= 0 && val
< 8) /* Avoid silly minimal values. */
1337 up
->pcflag
|= UDPLITE_RECV_CC
;
1348 int udp_setsockopt(struct sock
*sk
, int level
, int optname
,
1349 char __user
*optval
, int optlen
)
1351 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
1352 return udp_lib_setsockopt(sk
, level
, optname
, optval
, optlen
,
1353 udp_push_pending_frames
);
1354 return ip_setsockopt(sk
, level
, optname
, optval
, optlen
);
1357 #ifdef CONFIG_COMPAT
1358 int compat_udp_setsockopt(struct sock
*sk
, int level
, int optname
,
1359 char __user
*optval
, int optlen
)
1361 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
1362 return udp_lib_setsockopt(sk
, level
, optname
, optval
, optlen
,
1363 udp_push_pending_frames
);
1364 return compat_ip_setsockopt(sk
, level
, optname
, optval
, optlen
);
1368 int udp_lib_getsockopt(struct sock
*sk
, int level
, int optname
,
1369 char __user
*optval
, int __user
*optlen
)
1371 struct udp_sock
*up
= udp_sk(sk
);
1374 if (get_user(len
,optlen
))
1377 len
= min_t(unsigned int, len
, sizeof(int));
1388 val
= up
->encap_type
;
1391 /* The following two cannot be changed on UDP sockets, the return is
1392 * always 0 (which corresponds to the full checksum coverage of UDP). */
1393 case UDPLITE_SEND_CSCOV
:
1397 case UDPLITE_RECV_CSCOV
:
1402 return -ENOPROTOOPT
;
1405 if (put_user(len
, optlen
))
1407 if (copy_to_user(optval
, &val
,len
))
1412 int udp_getsockopt(struct sock
*sk
, int level
, int optname
,
1413 char __user
*optval
, int __user
*optlen
)
1415 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
1416 return udp_lib_getsockopt(sk
, level
, optname
, optval
, optlen
);
1417 return ip_getsockopt(sk
, level
, optname
, optval
, optlen
);
1420 #ifdef CONFIG_COMPAT
1421 int compat_udp_getsockopt(struct sock
*sk
, int level
, int optname
,
1422 char __user
*optval
, int __user
*optlen
)
1424 if (level
== SOL_UDP
|| level
== SOL_UDPLITE
)
1425 return udp_lib_getsockopt(sk
, level
, optname
, optval
, optlen
);
1426 return compat_ip_getsockopt(sk
, level
, optname
, optval
, optlen
);
1430 * udp_poll - wait for a UDP event.
1431 * @file - file struct
1433 * @wait - poll table
1435 * This is same as datagram poll, except for the special case of
1436 * blocking sockets. If application is using a blocking fd
1437 * and a packet with checksum error is in the queue;
1438 * then it could get return from select indicating data available
1439 * but then block when reading it. Add special case code
1440 * to work around these arguably broken applications.
1442 unsigned int udp_poll(struct file
*file
, struct socket
*sock
, poll_table
*wait
)
1444 unsigned int mask
= datagram_poll(file
, sock
, wait
);
1445 struct sock
*sk
= sock
->sk
;
1446 int is_lite
= IS_UDPLITE(sk
);
1448 /* Check for false positives due to checksum errors */
1449 if ( (mask
& POLLRDNORM
) &&
1450 !(file
->f_flags
& O_NONBLOCK
) &&
1451 !(sk
->sk_shutdown
& RCV_SHUTDOWN
)){
1452 struct sk_buff_head
*rcvq
= &sk
->sk_receive_queue
;
1453 struct sk_buff
*skb
;
1455 spin_lock_bh(&rcvq
->lock
);
1456 while ((skb
= skb_peek(rcvq
)) != NULL
&&
1457 udp_lib_checksum_complete(skb
)) {
1458 UDP_INC_STATS_BH(UDP_MIB_INERRORS
, is_lite
);
1459 __skb_unlink(skb
, rcvq
);
1462 spin_unlock_bh(&rcvq
->lock
);
1464 /* nothing to see, move along */
1466 mask
&= ~(POLLIN
| POLLRDNORM
);
1473 struct proto udp_prot
= {
1475 .owner
= THIS_MODULE
,
1476 .close
= udp_lib_close
,
1477 .connect
= ip4_datagram_connect
,
1478 .disconnect
= udp_disconnect
,
1480 .destroy
= udp_destroy_sock
,
1481 .setsockopt
= udp_setsockopt
,
1482 .getsockopt
= udp_getsockopt
,
1483 .sendmsg
= udp_sendmsg
,
1484 .recvmsg
= udp_recvmsg
,
1485 .sendpage
= udp_sendpage
,
1486 .backlog_rcv
= udp_queue_rcv_skb
,
1487 .hash
= udp_lib_hash
,
1488 .unhash
= udp_lib_unhash
,
1489 .get_port
= udp_v4_get_port
,
1490 .memory_allocated
= &udp_memory_allocated
,
1491 .sysctl_mem
= sysctl_udp_mem
,
1492 .sysctl_wmem
= &sysctl_udp_wmem_min
,
1493 .sysctl_rmem
= &sysctl_udp_rmem_min
,
1494 .obj_size
= sizeof(struct udp_sock
),
1495 .h
.udp_hash
= udp_hash
,
1496 #ifdef CONFIG_COMPAT
1497 .compat_setsockopt
= compat_udp_setsockopt
,
1498 .compat_getsockopt
= compat_udp_getsockopt
,
1502 /* ------------------------------------------------------------------------ */
1503 #ifdef CONFIG_PROC_FS
1505 static struct sock
*udp_get_first(struct seq_file
*seq
)
1508 struct udp_iter_state
*state
= seq
->private;
1509 struct net
*net
= seq_file_net(seq
);
1511 for (state
->bucket
= 0; state
->bucket
< UDP_HTABLE_SIZE
; ++state
->bucket
) {
1512 struct hlist_node
*node
;
1513 sk_for_each(sk
, node
, state
->hashtable
+ state
->bucket
) {
1514 if (!net_eq(sock_net(sk
), net
))
1516 if (sk
->sk_family
== state
->family
)
1525 static struct sock
*udp_get_next(struct seq_file
*seq
, struct sock
*sk
)
1527 struct udp_iter_state
*state
= seq
->private;
1528 struct net
*net
= seq_file_net(seq
);
1534 } while (sk
&& (!net_eq(sock_net(sk
), net
) || sk
->sk_family
!= state
->family
));
1536 if (!sk
&& ++state
->bucket
< UDP_HTABLE_SIZE
) {
1537 sk
= sk_head(state
->hashtable
+ state
->bucket
);
1543 static struct sock
*udp_get_idx(struct seq_file
*seq
, loff_t pos
)
1545 struct sock
*sk
= udp_get_first(seq
);
1548 while (pos
&& (sk
= udp_get_next(seq
, sk
)) != NULL
)
1550 return pos
? NULL
: sk
;
1553 static void *udp_seq_start(struct seq_file
*seq
, loff_t
*pos
)
1554 __acquires(udp_hash_lock
)
1556 read_lock(&udp_hash_lock
);
1557 return *pos
? udp_get_idx(seq
, *pos
-1) : SEQ_START_TOKEN
;
1560 static void *udp_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
1564 if (v
== SEQ_START_TOKEN
)
1565 sk
= udp_get_idx(seq
, 0);
1567 sk
= udp_get_next(seq
, v
);
1573 static void udp_seq_stop(struct seq_file
*seq
, void *v
)
1574 __releases(udp_hash_lock
)
1576 read_unlock(&udp_hash_lock
);
1579 static int udp_seq_open(struct inode
*inode
, struct file
*file
)
1581 struct udp_seq_afinfo
*afinfo
= PDE(inode
)->data
;
1582 struct udp_iter_state
*s
;
1585 err
= seq_open_net(inode
, file
, &afinfo
->seq_ops
,
1586 sizeof(struct udp_iter_state
));
1590 s
= ((struct seq_file
*)file
->private_data
)->private;
1591 s
->family
= afinfo
->family
;
1592 s
->hashtable
= afinfo
->hashtable
;
1596 /* ------------------------------------------------------------------------ */
1597 int udp_proc_register(struct net
*net
, struct udp_seq_afinfo
*afinfo
)
1599 struct proc_dir_entry
*p
;
1602 afinfo
->seq_fops
.open
= udp_seq_open
;
1603 afinfo
->seq_fops
.read
= seq_read
;
1604 afinfo
->seq_fops
.llseek
= seq_lseek
;
1605 afinfo
->seq_fops
.release
= seq_release_net
;
1607 afinfo
->seq_ops
.start
= udp_seq_start
;
1608 afinfo
->seq_ops
.next
= udp_seq_next
;
1609 afinfo
->seq_ops
.stop
= udp_seq_stop
;
1611 p
= proc_create_data(afinfo
->name
, S_IRUGO
, net
->proc_net
,
1612 &afinfo
->seq_fops
, afinfo
);
1618 void udp_proc_unregister(struct net
*net
, struct udp_seq_afinfo
*afinfo
)
1620 proc_net_remove(net
, afinfo
->name
);
1623 /* ------------------------------------------------------------------------ */
1624 static void udp4_format_sock(struct sock
*sp
, struct seq_file
*f
,
1625 int bucket
, int *len
)
1627 struct inet_sock
*inet
= inet_sk(sp
);
1628 __be32 dest
= inet
->daddr
;
1629 __be32 src
= inet
->rcv_saddr
;
1630 __u16 destp
= ntohs(inet
->dport
);
1631 __u16 srcp
= ntohs(inet
->sport
);
1633 seq_printf(f
, "%4d: %08X:%04X %08X:%04X"
1634 " %02X %08X:%08X %02X:%08lX %08X %5d %8d %lu %d %p %d%n",
1635 bucket
, src
, srcp
, dest
, destp
, sp
->sk_state
,
1636 atomic_read(&sp
->sk_wmem_alloc
),
1637 atomic_read(&sp
->sk_rmem_alloc
),
1638 0, 0L, 0, sock_i_uid(sp
), 0, sock_i_ino(sp
),
1639 atomic_read(&sp
->sk_refcnt
), sp
,
1640 atomic_read(&sp
->sk_drops
), len
);
1643 int udp4_seq_show(struct seq_file
*seq
, void *v
)
1645 if (v
== SEQ_START_TOKEN
)
1646 seq_printf(seq
, "%-127s\n",
1647 " sl local_address rem_address st tx_queue "
1648 "rx_queue tr tm->when retrnsmt uid timeout "
1649 "inode ref pointer drops");
1651 struct udp_iter_state
*state
= seq
->private;
1654 udp4_format_sock(v
, seq
, state
->bucket
, &len
);
1655 seq_printf(seq
, "%*s\n", 127 - len
,"");
1660 /* ------------------------------------------------------------------------ */
1661 static struct udp_seq_afinfo udp4_seq_afinfo
= {
1664 .hashtable
= udp_hash
,
1666 .owner
= THIS_MODULE
,
1669 .show
= udp4_seq_show
,
1673 static int udp4_proc_init_net(struct net
*net
)
1675 return udp_proc_register(net
, &udp4_seq_afinfo
);
1678 static void udp4_proc_exit_net(struct net
*net
)
1680 udp_proc_unregister(net
, &udp4_seq_afinfo
);
1683 static struct pernet_operations udp4_net_ops
= {
1684 .init
= udp4_proc_init_net
,
1685 .exit
= udp4_proc_exit_net
,
1688 int __init
udp4_proc_init(void)
1690 return register_pernet_subsys(&udp4_net_ops
);
1693 void udp4_proc_exit(void)
1695 unregister_pernet_subsys(&udp4_net_ops
);
1697 #endif /* CONFIG_PROC_FS */
1699 void __init
udp_init(void)
1701 unsigned long limit
;
1703 /* Set the pressure threshold up by the same strategy of TCP. It is a
1704 * fraction of global memory that is up to 1/2 at 256 MB, decreasing
1705 * toward zero with the amount of memory, with a floor of 128 pages.
1707 limit
= min(nr_all_pages
, 1UL<<(28-PAGE_SHIFT
)) >> (20-PAGE_SHIFT
);
1708 limit
= (limit
* (nr_all_pages
>> (20-PAGE_SHIFT
))) >> (PAGE_SHIFT
-11);
1709 limit
= max(limit
, 128UL);
1710 sysctl_udp_mem
[0] = limit
/ 4 * 3;
1711 sysctl_udp_mem
[1] = limit
;
1712 sysctl_udp_mem
[2] = sysctl_udp_mem
[0] * 2;
1714 sysctl_udp_rmem_min
= SK_MEM_QUANTUM
;
1715 sysctl_udp_wmem_min
= SK_MEM_QUANTUM
;
1718 EXPORT_SYMBOL(udp_disconnect
);
1719 EXPORT_SYMBOL(udp_hash
);
1720 EXPORT_SYMBOL(udp_hash_lock
);
1721 EXPORT_SYMBOL(udp_ioctl
);
1722 EXPORT_SYMBOL(udp_prot
);
1723 EXPORT_SYMBOL(udp_sendmsg
);
1724 EXPORT_SYMBOL(udp_lib_getsockopt
);
1725 EXPORT_SYMBOL(udp_lib_setsockopt
);
1726 EXPORT_SYMBOL(udp_poll
);
1727 EXPORT_SYMBOL(udp_lib_get_port
);
1729 #ifdef CONFIG_PROC_FS
1730 EXPORT_SYMBOL(udp_proc_register
);
1731 EXPORT_SYMBOL(udp_proc_unregister
);