projects / GitHub / mt8127 / android_kernel_alcatel_ttab.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
udp: increments sk_drops in __udp_queue_rcv_skb()
[GitHub/mt8127/android_kernel_alcatel_ttab.git] / net / ipv4 / udp.c
1 /*
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.
5 *
6 * The User Datagram Protocol (UDP).
7 *
8 * Authors: Ross Biro
9 * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
10 * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
11 * Alan Cox, <alan@lxorguk.ukuu.org.uk>
12 * Hirokazu Takahashi, <taka@valinux.co.jp>
13 *
14 * Fixes:
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
28 * does NOT close.
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
57 * for connect.
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
64 * datagrams.
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.
72 *
73 *
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.
78 */
79
80 #include <asm/system.h>
81 #include <asm/uaccess.h>
82 #include <asm/ioctls.h>
83 #include <linux/bootmem.h>
84 #include <linux/highmem.h>
85 #include <linux/swap.h>
86 #include <linux/types.h>
87 #include <linux/fcntl.h>
88 #include <linux/module.h>
89 #include <linux/socket.h>
90 #include <linux/sockios.h>
91 #include <linux/igmp.h>
92 #include <linux/in.h>
93 #include <linux/errno.h>
94 #include <linux/timer.h>
95 #include <linux/mm.h>
96 #include <linux/inet.h>
97 #include <linux/netdevice.h>
98 #include <net/tcp_states.h>
99 #include <linux/skbuff.h>
100 #include <linux/proc_fs.h>
101 #include <linux/seq_file.h>
102 #include <net/net_namespace.h>
103 #include <net/icmp.h>
104 #include <net/route.h>
105 #include <net/checksum.h>
106 #include <net/xfrm.h>
107 #include "udp_impl.h"
108
109 struct udp_table udp_table;
110 EXPORT_SYMBOL(udp_table);
111
112 int sysctl_udp_mem[3] __read_mostly;
113 int sysctl_udp_rmem_min __read_mostly;
114 int sysctl_udp_wmem_min __read_mostly;
115
116 EXPORT_SYMBOL(sysctl_udp_mem);
117 EXPORT_SYMBOL(sysctl_udp_rmem_min);
118 EXPORT_SYMBOL(sysctl_udp_wmem_min);
119
120 atomic_t udp_memory_allocated;
121 EXPORT_SYMBOL(udp_memory_allocated);
122
123 #define PORTS_PER_CHAIN (65536 / UDP_HTABLE_SIZE)
124
125 static int udp_lib_lport_inuse(struct net *net, __u16 num,
126 const struct udp_hslot *hslot,
127 unsigned long *bitmap,
128 struct sock *sk,
129 int (*saddr_comp)(const struct sock *sk1,
130 const struct sock *sk2))
131 {
132 struct sock *sk2;
133 struct hlist_nulls_node *node;
134
135 sk_nulls_for_each(sk2, node, &hslot->head)
136 if (net_eq(sock_net(sk2), net) &&
137 sk2 != sk &&
138 (bitmap || sk2->sk_hash == num) &&
139 (!sk2->sk_reuse || !sk->sk_reuse) &&
140 (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if
141 || sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
142 (*saddr_comp)(sk, sk2)) {
143 if (bitmap)
144 __set_bit(sk2->sk_hash / UDP_HTABLE_SIZE,
145 bitmap);
146 else
147 return 1;
148 }
149 return 0;
150 }
151
152 /**
153 * udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
154 *
155 * @sk: socket struct in question
156 * @snum: port number to look up
157 * @saddr_comp: AF-dependent comparison of bound local IP addresses
158 */
159 int udp_lib_get_port(struct sock *sk, unsigned short snum,
160 int (*saddr_comp)(const struct sock *sk1,
161 const struct sock *sk2 ) )
162 {
163 struct udp_hslot *hslot;
164 struct udp_table *udptable = sk->sk_prot->h.udp_table;
165 int error = 1;
166 struct net *net = sock_net(sk);
167
168 if (!snum) {
169 int low, high, remaining;
170 unsigned rand;
171 unsigned short first, last;
172 DECLARE_BITMAP(bitmap, PORTS_PER_CHAIN);
173
174 inet_get_local_port_range(&low, &high);
175 remaining = (high - low) + 1;
176
177 rand = net_random();
178 first = (((u64)rand * remaining) >> 32) + low;
179 /*
180 * force rand to be an odd multiple of UDP_HTABLE_SIZE
181 */
182 rand = (rand | 1) * UDP_HTABLE_SIZE;
183 for (last = first + UDP_HTABLE_SIZE; first != last; first++) {
184 hslot = &udptable->hash[udp_hashfn(net, first)];
185 bitmap_zero(bitmap, PORTS_PER_CHAIN);
186 spin_lock_bh(&hslot->lock);
187 udp_lib_lport_inuse(net, snum, hslot, bitmap, sk,
188 saddr_comp);
189
190 snum = first;
191 /*
192 * Iterate on all possible values of snum for this hash.
193 * Using steps of an odd multiple of UDP_HTABLE_SIZE
194 * give us randomization and full range coverage.
195 */
196 do {
197 if (low <= snum && snum <= high &&
198 !test_bit(snum / UDP_HTABLE_SIZE, bitmap))
199 goto found;
200 snum += rand;
201 } while (snum != first);
202 spin_unlock_bh(&hslot->lock);
203 }
204 goto fail;
205 } else {
206 hslot = &udptable->hash[udp_hashfn(net, snum)];
207 spin_lock_bh(&hslot->lock);
208 if (udp_lib_lport_inuse(net, snum, hslot, NULL, sk, saddr_comp))
209 goto fail_unlock;
210 }
211 found:
212 inet_sk(sk)->num = snum;
213 sk->sk_hash = snum;
214 if (sk_unhashed(sk)) {
215 sk_nulls_add_node_rcu(sk, &hslot->head);
216 sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1);
217 }
218 error = 0;
219 fail_unlock:
220 spin_unlock_bh(&hslot->lock);
221 fail:
222 return error;
223 }
224
225 static int ipv4_rcv_saddr_equal(const struct sock *sk1, const struct sock *sk2)
226 {
227 struct inet_sock *inet1 = inet_sk(sk1), *inet2 = inet_sk(sk2);
228
229 return ( !ipv6_only_sock(sk2) &&
230 (!inet1->rcv_saddr || !inet2->rcv_saddr ||
231 inet1->rcv_saddr == inet2->rcv_saddr ));
232 }
233
234 int udp_v4_get_port(struct sock *sk, unsigned short snum)
235 {
236 return udp_lib_get_port(sk, snum, ipv4_rcv_saddr_equal);
237 }
238
239 static inline int compute_score(struct sock *sk, struct net *net, __be32 saddr,
240 unsigned short hnum,
241 __be16 sport, __be32 daddr, __be16 dport, int dif)
242 {
243 int score = -1;
244
245 if (net_eq(sock_net(sk), net) && sk->sk_hash == hnum &&
246 !ipv6_only_sock(sk)) {
247 struct inet_sock *inet = inet_sk(sk);
248
249 score = (sk->sk_family == PF_INET ? 1 : 0);
250 if (inet->rcv_saddr) {
251 if (inet->rcv_saddr != daddr)
252 return -1;
253 score += 2;
254 }
255 if (inet->daddr) {
256 if (inet->daddr != saddr)
257 return -1;
258 score += 2;
259 }
260 if (inet->dport) {
261 if (inet->dport != sport)
262 return -1;
263 score += 2;
264 }
265 if (sk->sk_bound_dev_if) {
266 if (sk->sk_bound_dev_if != dif)
267 return -1;
268 score += 2;
269 }
270 }
271 return score;
272 }
273
274 /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
275 * harder than this. -DaveM
276 */
277 static struct sock *__udp4_lib_lookup(struct net *net, __be32 saddr,
278 __be16 sport, __be32 daddr, __be16 dport,
279 int dif, struct udp_table *udptable)
280 {
281 struct sock *sk, *result;
282 struct hlist_nulls_node *node;
283 unsigned short hnum = ntohs(dport);
284 unsigned int hash = udp_hashfn(net, hnum);
285 struct udp_hslot *hslot = &udptable->hash[hash];
286 int score, badness;
287
288 rcu_read_lock();
289 begin:
290 result = NULL;
291 badness = -1;
292 sk_nulls_for_each_rcu(sk, node, &hslot->head) {
293 score = compute_score(sk, net, saddr, hnum, sport,
294 daddr, dport, dif);
295 if (score > badness) {
296 result = sk;
297 badness = score;
298 }
299 }
300 /*
301 * if the nulls value we got at the end of this lookup is
302 * not the expected one, we must restart lookup.
303 * We probably met an item that was moved to another chain.
304 */
305 if (get_nulls_value(node) != hash)
306 goto begin;
307
308 if (result) {
309 if (unlikely(!atomic_inc_not_zero(&result->sk_refcnt)))
310 result = NULL;
311 else if (unlikely(compute_score(result, net, saddr, hnum, sport,
312 daddr, dport, dif) < badness)) {
313 sock_put(result);
314 goto begin;
315 }
316 }
317 rcu_read_unlock();
318 return result;
319 }
320
321 static inline struct sock *__udp4_lib_lookup_skb(struct sk_buff *skb,
322 __be16 sport, __be16 dport,
323 struct udp_table *udptable)
324 {
325 struct sock *sk;
326 const struct iphdr *iph = ip_hdr(skb);
327
328 if (unlikely(sk = skb_steal_sock(skb)))
329 return sk;
330 else
331 return __udp4_lib_lookup(dev_net(skb->dst->dev), iph->saddr, sport,
332 iph->daddr, dport, inet_iif(skb),
333 udptable);
334 }
335
336 struct sock *udp4_lib_lookup(struct net *net, __be32 saddr, __be16 sport,
337 __be32 daddr, __be16 dport, int dif)
338 {
339 return __udp4_lib_lookup(net, saddr, sport, daddr, dport, dif, &udp_table);
340 }
341 EXPORT_SYMBOL_GPL(udp4_lib_lookup);
342
343 static inline struct sock *udp_v4_mcast_next(struct net *net, struct sock *sk,
344 __be16 loc_port, __be32 loc_addr,
345 __be16 rmt_port, __be32 rmt_addr,
346 int dif)
347 {
348 struct hlist_nulls_node *node;
349 struct sock *s = sk;
350 unsigned short hnum = ntohs(loc_port);
351
352 sk_nulls_for_each_from(s, node) {
353 struct inet_sock *inet = inet_sk(s);
354
355 if (!net_eq(sock_net(s), net) ||
356 s->sk_hash != hnum ||
357 (inet->daddr && inet->daddr != rmt_addr) ||
358 (inet->dport != rmt_port && inet->dport) ||
359 (inet->rcv_saddr && inet->rcv_saddr != loc_addr) ||
360 ipv6_only_sock(s) ||
361 (s->sk_bound_dev_if && s->sk_bound_dev_if != dif))
362 continue;
363 if (!ip_mc_sf_allow(s, loc_addr, rmt_addr, dif))
364 continue;
365 goto found;
366 }
367 s = NULL;
368 found:
369 return s;
370 }
371
372 /*
373 * This routine is called by the ICMP module when it gets some
374 * sort of error condition. If err < 0 then the socket should
375 * be closed and the error returned to the user. If err > 0
376 * it's just the icmp type << 8 | icmp code.
377 * Header points to the ip header of the error packet. We move
378 * on past this. Then (as it used to claim before adjustment)
379 * header points to the first 8 bytes of the udp header. We need
380 * to find the appropriate port.
381 */
382
383 void __udp4_lib_err(struct sk_buff *skb, u32 info, struct udp_table *udptable)
384 {
385 struct inet_sock *inet;
386 struct iphdr *iph = (struct iphdr*)skb->data;
387 struct udphdr *uh = (struct udphdr*)(skb->data+(iph->ihl<<2));
388 const int type = icmp_hdr(skb)->type;
389 const int code = icmp_hdr(skb)->code;
390 struct sock *sk;
391 int harderr;
392 int err;
393 struct net *net = dev_net(skb->dev);
394
395 sk = __udp4_lib_lookup(net, iph->daddr, uh->dest,
396 iph->saddr, uh->source, skb->dev->ifindex, udptable);
397 if (sk == NULL) {
398 ICMP_INC_STATS_BH(net, ICMP_MIB_INERRORS);
399 return; /* No socket for error */
400 }
401
402 err = 0;
403 harderr = 0;
404 inet = inet_sk(sk);
405
406 switch (type) {
407 default:
408 case ICMP_TIME_EXCEEDED:
409 err = EHOSTUNREACH;
410 break;
411 case ICMP_SOURCE_QUENCH:
412 goto out;
413 case ICMP_PARAMETERPROB:
414 err = EPROTO;
415 harderr = 1;
416 break;
417 case ICMP_DEST_UNREACH:
418 if (code == ICMP_FRAG_NEEDED) { /* Path MTU discovery */
419 if (inet->pmtudisc != IP_PMTUDISC_DONT) {
420 err = EMSGSIZE;
421 harderr = 1;
422 break;
423 }
424 goto out;
425 }
426 err = EHOSTUNREACH;
427 if (code <= NR_ICMP_UNREACH) {
428 harderr = icmp_err_convert[code].fatal;
429 err = icmp_err_convert[code].errno;
430 }
431 break;
432 }
433
434 /*
435 * RFC1122: OK. Passes ICMP errors back to application, as per
436 * 4.1.3.3.
437 */
438 if (!inet->recverr) {
439 if (!harderr || sk->sk_state != TCP_ESTABLISHED)
440 goto out;
441 } else {
442 ip_icmp_error(sk, skb, err, uh->dest, info, (u8*)(uh+1));
443 }
444 sk->sk_err = err;
445 sk->sk_error_report(sk);
446 out:
447 sock_put(sk);
448 }
449
450 void udp_err(struct sk_buff *skb, u32 info)
451 {
452 __udp4_lib_err(skb, info, &udp_table);
453 }
454
455 /*
456 * Throw away all pending data and cancel the corking. Socket is locked.
457 */
458 void udp_flush_pending_frames(struct sock *sk)
459 {
460 struct udp_sock *up = udp_sk(sk);
461
462 if (up->pending) {
463 up->len = 0;
464 up->pending = 0;
465 ip_flush_pending_frames(sk);
466 }
467 }
468 EXPORT_SYMBOL(udp_flush_pending_frames);
469
470 /**
471 * udp4_hwcsum_outgoing - handle outgoing HW checksumming
472 * @sk: socket we are sending on
473 * @skb: sk_buff containing the filled-in UDP header
474 * (checksum field must be zeroed out)
475 */
476 static void udp4_hwcsum_outgoing(struct sock *sk, struct sk_buff *skb,
477 __be32 src, __be32 dst, int len )
478 {
479 unsigned int offset;
480 struct udphdr *uh = udp_hdr(skb);
481 __wsum csum = 0;
482
483 if (skb_queue_len(&sk->sk_write_queue) == 1) {
484 /*
485 * Only one fragment on the socket.
486 */
487 skb->csum_start = skb_transport_header(skb) - skb->head;
488 skb->csum_offset = offsetof(struct udphdr, check);
489 uh->check = ~csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, 0);
490 } else {
491 /*
492 * HW-checksum won't work as there are two or more
493 * fragments on the socket so that all csums of sk_buffs
494 * should be together
495 */
496 offset = skb_transport_offset(skb);
497 skb->csum = skb_checksum(skb, offset, skb->len - offset, 0);
498
499 skb->ip_summed = CHECKSUM_NONE;
500
501 skb_queue_walk(&sk->sk_write_queue, skb) {
502 csum = csum_add(csum, skb->csum);
503 }
504
505 uh->check = csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, csum);
506 if (uh->check == 0)
507 uh->check = CSUM_MANGLED_0;
508 }
509 }
510
511 /*
512 * Push out all pending data as one UDP datagram. Socket is locked.
513 */
514 static int udp_push_pending_frames(struct sock *sk)
515 {
516 struct udp_sock *up = udp_sk(sk);
517 struct inet_sock *inet = inet_sk(sk);
518 struct flowi *fl = &inet->cork.fl;
519 struct sk_buff *skb;
520 struct udphdr *uh;
521 int err = 0;
522 int is_udplite = IS_UDPLITE(sk);
523 __wsum csum = 0;
524
525 /* Grab the skbuff where UDP header space exists. */
526 if ((skb = skb_peek(&sk->sk_write_queue)) == NULL)
527 goto out;
528
529 /*
530 * Create a UDP header
531 */
532 uh = udp_hdr(skb);
533 uh->source = fl->fl_ip_sport;
534 uh->dest = fl->fl_ip_dport;
535 uh->len = htons(up->len);
536 uh->check = 0;
537
538 if (is_udplite) /* UDP-Lite */
539 csum = udplite_csum_outgoing(sk, skb);
540
541 else if (sk->sk_no_check == UDP_CSUM_NOXMIT) { /* UDP csum disabled */
542
543 skb->ip_summed = CHECKSUM_NONE;
544 goto send;
545
546 } else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */
547
548 udp4_hwcsum_outgoing(sk, skb, fl->fl4_src,fl->fl4_dst, up->len);
549 goto send;
550
551 } else /* `normal' UDP */
552 csum = udp_csum_outgoing(sk, skb);
553
554 /* add protocol-dependent pseudo-header */
555 uh->check = csum_tcpudp_magic(fl->fl4_src, fl->fl4_dst, up->len,
556 sk->sk_protocol, csum );
557 if (uh->check == 0)
558 uh->check = CSUM_MANGLED_0;
559
560 send:
561 err = ip_push_pending_frames(sk);
562 out:
563 up->len = 0;
564 up->pending = 0;
565 if (!err)
566 UDP_INC_STATS_USER(sock_net(sk),
567 UDP_MIB_OUTDATAGRAMS, is_udplite);
568 return err;
569 }
570
571 int udp_sendmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
572 size_t len)
573 {
574 struct inet_sock *inet = inet_sk(sk);
575 struct udp_sock *up = udp_sk(sk);
576 int ulen = len;
577 struct ipcm_cookie ipc;
578 struct rtable *rt = NULL;
579 int free = 0;
580 int connected = 0;
581 __be32 daddr, faddr, saddr;
582 __be16 dport;
583 u8 tos;
584 int err, is_udplite = IS_UDPLITE(sk);
585 int corkreq = up->corkflag || msg->msg_flags&MSG_MORE;
586 int (*getfrag)(void *, char *, int, int, int, struct sk_buff *);
587
588 if (len > 0xFFFF)
589 return -EMSGSIZE;
590
591 /*
592 * Check the flags.
593 */
594
595 if (msg->msg_flags&MSG_OOB) /* Mirror BSD error message compatibility */
596 return -EOPNOTSUPP;
597
598 ipc.opt = NULL;
599
600 if (up->pending) {
601 /*
602 * There are pending frames.
603 * The socket lock must be held while it's corked.
604 */
605 lock_sock(sk);
606 if (likely(up->pending)) {
607 if (unlikely(up->pending != AF_INET)) {
608 release_sock(sk);
609 return -EINVAL;
610 }
611 goto do_append_data;
612 }
613 release_sock(sk);
614 }
615 ulen += sizeof(struct udphdr);
616
617 /*
618 * Get and verify the address.
619 */
620 if (msg->msg_name) {
621 struct sockaddr_in * usin = (struct sockaddr_in*)msg->msg_name;
622 if (msg->msg_namelen < sizeof(*usin))
623 return -EINVAL;
624 if (usin->sin_family != AF_INET) {
625 if (usin->sin_family != AF_UNSPEC)
626 return -EAFNOSUPPORT;
627 }
628
629 daddr = usin->sin_addr.s_addr;
630 dport = usin->sin_port;
631 if (dport == 0)
632 return -EINVAL;
633 } else {
634 if (sk->sk_state != TCP_ESTABLISHED)
635 return -EDESTADDRREQ;
636 daddr = inet->daddr;
637 dport = inet->dport;
638 /* Open fast path for connected socket.
639 Route will not be used, if at least one option is set.
640 */
641 connected = 1;
642 }
643 ipc.addr = inet->saddr;
644
645 ipc.oif = sk->sk_bound_dev_if;
646 if (msg->msg_controllen) {
647 err = ip_cmsg_send(sock_net(sk), msg, &ipc);
648 if (err)
649 return err;
650 if (ipc.opt)
651 free = 1;
652 connected = 0;
653 }
654 if (!ipc.opt)
655 ipc.opt = inet->opt;
656
657 saddr = ipc.addr;
658 ipc.addr = faddr = daddr;
659
660 if (ipc.opt && ipc.opt->srr) {
661 if (!daddr)
662 return -EINVAL;
663 faddr = ipc.opt->faddr;
664 connected = 0;
665 }
666 tos = RT_TOS(inet->tos);
667 if (sock_flag(sk, SOCK_LOCALROUTE) ||
668 (msg->msg_flags & MSG_DONTROUTE) ||
669 (ipc.opt && ipc.opt->is_strictroute)) {
670 tos |= RTO_ONLINK;
671 connected = 0;
672 }
673
674 if (ipv4_is_multicast(daddr)) {
675 if (!ipc.oif)
676 ipc.oif = inet->mc_index;
677 if (!saddr)
678 saddr = inet->mc_addr;
679 connected = 0;
680 }
681
682 if (connected)
683 rt = (struct rtable*)sk_dst_check(sk, 0);
684
685 if (rt == NULL) {
686 struct flowi fl = { .oif = ipc.oif,
687 .nl_u = { .ip4_u =
688 { .daddr = faddr,
689 .saddr = saddr,
690 .tos = tos } },
691 .proto = sk->sk_protocol,
692 .flags = inet_sk_flowi_flags(sk),
693 .uli_u = { .ports =
694 { .sport = inet->sport,
695 .dport = dport } } };
696 struct net *net = sock_net(sk);
697
698 security_sk_classify_flow(sk, &fl);
699 err = ip_route_output_flow(net, &rt, &fl, sk, 1);
700 if (err) {
701 if (err == -ENETUNREACH)
702 IP_INC_STATS_BH(net, IPSTATS_MIB_OUTNOROUTES);
703 goto out;
704 }
705
706 err = -EACCES;
707 if ((rt->rt_flags & RTCF_BROADCAST) &&
708 !sock_flag(sk, SOCK_BROADCAST))
709 goto out;
710 if (connected)
711 sk_dst_set(sk, dst_clone(&rt->u.dst));
712 }
713
714 if (msg->msg_flags&MSG_CONFIRM)
715 goto do_confirm;
716 back_from_confirm:
717
718 saddr = rt->rt_src;
719 if (!ipc.addr)
720 daddr = ipc.addr = rt->rt_dst;
721
722 lock_sock(sk);
723 if (unlikely(up->pending)) {
724 /* The socket is already corked while preparing it. */
725 /* ... which is an evident application bug. --ANK */
726 release_sock(sk);
727
728 LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 2\n");
729 err = -EINVAL;
730 goto out;
731 }
732 /*
733 * Now cork the socket to pend data.
734 */
735 inet->cork.fl.fl4_dst = daddr;
736 inet->cork.fl.fl_ip_dport = dport;
737 inet->cork.fl.fl4_src = saddr;
738 inet->cork.fl.fl_ip_sport = inet->sport;
739 up->pending = AF_INET;
740
741 do_append_data:
742 up->len += ulen;
743 getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag;
744 err = ip_append_data(sk, getfrag, msg->msg_iov, ulen,
745 sizeof(struct udphdr), &ipc, &rt,
746 corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags);
747 if (err)
748 udp_flush_pending_frames(sk);
749 else if (!corkreq)
750 err = udp_push_pending_frames(sk);
751 else if (unlikely(skb_queue_empty(&sk->sk_write_queue)))
752 up->pending = 0;
753 release_sock(sk);
754
755 out:
756 ip_rt_put(rt);
757 if (free)
758 kfree(ipc.opt);
759 if (!err)
760 return len;
761 /*
762 * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
763 * ENOBUFS might not be good (it's not tunable per se), but otherwise
764 * we don't have a good statistic (IpOutDiscards but it can be too many
765 * things). We could add another new stat but at least for now that
766 * seems like overkill.
767 */
768 if (err == -ENOBUFS || test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
769 UDP_INC_STATS_USER(sock_net(sk),
770 UDP_MIB_SNDBUFERRORS, is_udplite);
771 }
772 return err;
773
774 do_confirm:
775 dst_confirm(&rt->u.dst);
776 if (!(msg->msg_flags&MSG_PROBE) || len)
777 goto back_from_confirm;
778 err = 0;
779 goto out;
780 }
781
782 int udp_sendpage(struct sock *sk, struct page *page, int offset,
783 size_t size, int flags)
784 {
785 struct udp_sock *up = udp_sk(sk);
786 int ret;
787
788 if (!up->pending) {
789 struct msghdr msg = { .msg_flags = flags|MSG_MORE };
790
791 /* Call udp_sendmsg to specify destination address which
792 * sendpage interface can't pass.
793 * This will succeed only when the socket is connected.
794 */
795 ret = udp_sendmsg(NULL, sk, &msg, 0);
796 if (ret < 0)
797 return ret;
798 }
799
800 lock_sock(sk);
801
802 if (unlikely(!up->pending)) {
803 release_sock(sk);
804
805 LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 3\n");
806 return -EINVAL;
807 }
808
809 ret = ip_append_page(sk, page, offset, size, flags);
810 if (ret == -EOPNOTSUPP) {
811 release_sock(sk);
812 return sock_no_sendpage(sk->sk_socket, page, offset,
813 size, flags);
814 }
815 if (ret < 0) {
816 udp_flush_pending_frames(sk);
817 goto out;
818 }
819
820 up->len += size;
821 if (!(up->corkflag || (flags&MSG_MORE)))
822 ret = udp_push_pending_frames(sk);
823 if (!ret)
824 ret = size;
825 out:
826 release_sock(sk);
827 return ret;
828 }
829
830 /*
831 * IOCTL requests applicable to the UDP protocol
832 */
833
834 int udp_ioctl(struct sock *sk, int cmd, unsigned long arg)
835 {
836 switch (cmd) {
837 case SIOCOUTQ:
838 {
839 int amount = atomic_read(&sk->sk_wmem_alloc);
840 return put_user(amount, (int __user *)arg);
841 }
842
843 case SIOCINQ:
844 {
845 struct sk_buff *skb;
846 unsigned long amount;
847
848 amount = 0;
849 spin_lock_bh(&sk->sk_receive_queue.lock);
850 skb = skb_peek(&sk->sk_receive_queue);
851 if (skb != NULL) {
852 /*
853 * We will only return the amount
854 * of this packet since that is all
855 * that will be read.
856 */
857 amount = skb->len - sizeof(struct udphdr);
858 }
859 spin_unlock_bh(&sk->sk_receive_queue.lock);
860 return put_user(amount, (int __user *)arg);
861 }
862
863 default:
864 return -ENOIOCTLCMD;
865 }
866
867 return 0;
868 }
869
870 /*
871 * This should be easy, if there is something there we
872 * return it, otherwise we block.
873 */
874
875 int udp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
876 size_t len, int noblock, int flags, int *addr_len)
877 {
878 struct inet_sock *inet = inet_sk(sk);
879 struct sockaddr_in *sin = (struct sockaddr_in *)msg->msg_name;
880 struct sk_buff *skb;
881 unsigned int ulen, copied;
882 int peeked;
883 int err;
884 int is_udplite = IS_UDPLITE(sk);
885
886 /*
887 * Check any passed addresses
888 */
889 if (addr_len)
890 *addr_len=sizeof(*sin);
891
892 if (flags & MSG_ERRQUEUE)
893 return ip_recv_error(sk, msg, len);
894
895 try_again:
896 skb = __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0),
897 &peeked, &err);
898 if (!skb)
899 goto out;
900
901 ulen = skb->len - sizeof(struct udphdr);
902 copied = len;
903 if (copied > ulen)
904 copied = ulen;
905 else if (copied < ulen)
906 msg->msg_flags |= MSG_TRUNC;
907
908 /*
909 * If checksum is needed at all, try to do it while copying the
910 * data. If the data is truncated, or if we only want a partial
911 * coverage checksum (UDP-Lite), do it before the copy.
912 */
913
914 if (copied < ulen || UDP_SKB_CB(skb)->partial_cov) {
915 if (udp_lib_checksum_complete(skb))
916 goto csum_copy_err;
917 }
918
919 if (skb_csum_unnecessary(skb))
920 err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr),
921 msg->msg_iov, copied );
922 else {
923 err = skb_copy_and_csum_datagram_iovec(skb, sizeof(struct udphdr), msg->msg_iov);
924
925 if (err == -EINVAL)
926 goto csum_copy_err;
927 }
928
929 if (err)
930 goto out_free;
931
932 if (!peeked)
933 UDP_INC_STATS_USER(sock_net(sk),
934 UDP_MIB_INDATAGRAMS, is_udplite);
935
936 sock_recv_timestamp(msg, sk, skb);
937
938 /* Copy the address. */
939 if (sin)
940 {
941 sin->sin_family = AF_INET;
942 sin->sin_port = udp_hdr(skb)->source;
943 sin->sin_addr.s_addr = ip_hdr(skb)->saddr;
944 memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
945 }
946 if (inet->cmsg_flags)
947 ip_cmsg_recv(msg, skb);
948
949 err = copied;
950 if (flags & MSG_TRUNC)
951 err = ulen;
952
953 out_free:
954 lock_sock(sk);
955 skb_free_datagram(sk, skb);
956 release_sock(sk);
957 out:
958 return err;
959
960 csum_copy_err:
961 lock_sock(sk);
962 if (!skb_kill_datagram(sk, skb, flags))
963 UDP_INC_STATS_USER(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
964 release_sock(sk);
965
966 if (noblock)
967 return -EAGAIN;
968 goto try_again;
969 }
970
971
972 int udp_disconnect(struct sock *sk, int flags)
973 {
974 struct inet_sock *inet = inet_sk(sk);
975 /*
976 * 1003.1g - break association.
977 */
978
979 sk->sk_state = TCP_CLOSE;
980 inet->daddr = 0;
981 inet->dport = 0;
982 sk->sk_bound_dev_if = 0;
983 if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
984 inet_reset_saddr(sk);
985
986 if (!(sk->sk_userlocks & SOCK_BINDPORT_LOCK)) {
987 sk->sk_prot->unhash(sk);
988 inet->sport = 0;
989 }
990 sk_dst_reset(sk);
991 return 0;
992 }
993
994 void udp_lib_unhash(struct sock *sk)
995 {
996 if (sk_hashed(sk)) {
997 struct udp_table *udptable = sk->sk_prot->h.udp_table;
998 unsigned int hash = udp_hashfn(sock_net(sk), sk->sk_hash);
999 struct udp_hslot *hslot = &udptable->hash[hash];
1000
1001 spin_lock_bh(&hslot->lock);
1002 if (sk_nulls_del_node_init_rcu(sk)) {
1003 inet_sk(sk)->num = 0;
1004 sock_prot_inuse_add(sock_net(sk), sk->sk_prot, -1);
1005 }
1006 spin_unlock_bh(&hslot->lock);
1007 }
1008 }
1009 EXPORT_SYMBOL(udp_lib_unhash);
1010
1011 static int __udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
1012 {
1013 int is_udplite = IS_UDPLITE(sk);
1014 int rc;
1015
1016 if ((rc = sock_queue_rcv_skb(sk, skb)) < 0) {
1017 /* Note that an ENOMEM error is charged twice */
1018 if (rc == -ENOMEM) {
1019 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
1020 is_udplite);
1021 atomic_inc(&sk->sk_drops);
1022 }
1023 goto drop;
1024 }
1025
1026 return 0;
1027
1028 drop:
1029 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1030 kfree_skb(skb);
1031 return -1;
1032 }
1033
1034 /* returns:
1035 * -1: error
1036 * 0: success
1037 * >0: "udp encap" protocol resubmission
1038 *
1039 * Note that in the success and error cases, the skb is assumed to
1040 * have either been requeued or freed.
1041 */
1042 int udp_queue_rcv_skb(struct sock * sk, struct sk_buff *skb)
1043 {
1044 struct udp_sock *up = udp_sk(sk);
1045 int rc;
1046 int is_udplite = IS_UDPLITE(sk);
1047
1048 /*
1049 * Charge it to the socket, dropping if the queue is full.
1050 */
1051 if (!xfrm4_policy_check(sk, XFRM_POLICY_IN, skb))
1052 goto drop;
1053 nf_reset(skb);
1054
1055 if (up->encap_type) {
1056 /*
1057 * This is an encapsulation socket so pass the skb to
1058 * the socket's udp_encap_rcv() hook. Otherwise, just
1059 * fall through and pass this up the UDP socket.
1060 * up->encap_rcv() returns the following value:
1061 * =0 if skb was successfully passed to the encap
1062 * handler or was discarded by it.
1063 * >0 if skb should be passed on to UDP.
1064 * <0 if skb should be resubmitted as proto -N
1065 */
1066
1067 /* if we're overly short, let UDP handle it */
1068 if (skb->len > sizeof(struct udphdr) &&
1069 up->encap_rcv != NULL) {
1070 int ret;
1071
1072 ret = (*up->encap_rcv)(sk, skb);
1073 if (ret <= 0) {
1074 UDP_INC_STATS_BH(sock_net(sk),
1075 UDP_MIB_INDATAGRAMS,
1076 is_udplite);
1077 return -ret;
1078 }
1079 }
1080
1081 /* FALLTHROUGH -- it's a UDP Packet */
1082 }
1083
1084 /*
1085 * UDP-Lite specific tests, ignored on UDP sockets
1086 */
1087 if ((is_udplite & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) {
1088
1089 /*
1090 * MIB statistics other than incrementing the error count are
1091 * disabled for the following two types of errors: these depend
1092 * on the application settings, not on the functioning of the
1093 * protocol stack as such.
1094 *
1095 * RFC 3828 here recommends (sec 3.3): "There should also be a
1096 * way ... to ... at least let the receiving application block
1097 * delivery of packets with coverage values less than a value
1098 * provided by the application."
1099 */
1100 if (up->pcrlen == 0) { /* full coverage was set */
1101 LIMIT_NETDEBUG(KERN_WARNING "UDPLITE: partial coverage "
1102 "%d while full coverage %d requested\n",
1103 UDP_SKB_CB(skb)->cscov, skb->len);
1104 goto drop;
1105 }
1106 /* The next case involves violating the min. coverage requested
1107 * by the receiver. This is subtle: if receiver wants x and x is
1108 * greater than the buffersize/MTU then receiver will complain
1109 * that it wants x while sender emits packets of smaller size y.
1110 * Therefore the above ...()->partial_cov statement is essential.
1111 */
1112 if (UDP_SKB_CB(skb)->cscov < up->pcrlen) {
1113 LIMIT_NETDEBUG(KERN_WARNING
1114 "UDPLITE: coverage %d too small, need min %d\n",
1115 UDP_SKB_CB(skb)->cscov, up->pcrlen);
1116 goto drop;
1117 }
1118 }
1119
1120 if (sk->sk_filter) {
1121 if (udp_lib_checksum_complete(skb))
1122 goto drop;
1123 }
1124
1125 rc = 0;
1126
1127 bh_lock_sock(sk);
1128 if (!sock_owned_by_user(sk))
1129 rc = __udp_queue_rcv_skb(sk, skb);
1130 else
1131 sk_add_backlog(sk, skb);
1132 bh_unlock_sock(sk);
1133
1134 return rc;
1135
1136 drop:
1137 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1138 kfree_skb(skb);
1139 return -1;
1140 }
1141
1142 /*
1143 * Multicasts and broadcasts go to each listener.
1144 *
1145 * Note: called only from the BH handler context,
1146 * so we don't need to lock the hashes.
1147 */
1148 static int __udp4_lib_mcast_deliver(struct net *net, struct sk_buff *skb,
1149 struct udphdr *uh,
1150 __be32 saddr, __be32 daddr,
1151 struct udp_table *udptable)
1152 {
1153 struct sock *sk;
1154 struct udp_hslot *hslot = &udptable->hash[udp_hashfn(net, ntohs(uh->dest))];
1155 int dif;
1156
1157 spin_lock(&hslot->lock);
1158 sk = sk_nulls_head(&hslot->head);
1159 dif = skb->dev->ifindex;
1160 sk = udp_v4_mcast_next(net, sk, uh->dest, daddr, uh->source, saddr, dif);
1161 if (sk) {
1162 struct sock *sknext = NULL;
1163
1164 do {
1165 struct sk_buff *skb1 = skb;
1166
1167 sknext = udp_v4_mcast_next(net, sk_nulls_next(sk), uh->dest,
1168 daddr, uh->source, saddr,
1169 dif);
1170 if (sknext)
1171 skb1 = skb_clone(skb, GFP_ATOMIC);
1172
1173 if (skb1) {
1174 int ret = udp_queue_rcv_skb(sk, skb1);
1175 if (ret > 0)
1176 /* we should probably re-process instead
1177 * of dropping packets here. */
1178 kfree_skb(skb1);
1179 }
1180 sk = sknext;
1181 } while (sknext);
1182 } else
1183 kfree_skb(skb);
1184 spin_unlock(&hslot->lock);
1185 return 0;
1186 }
1187
1188 /* Initialize UDP checksum. If exited with zero value (success),
1189 * CHECKSUM_UNNECESSARY means, that no more checks are required.
1190 * Otherwise, csum completion requires chacksumming packet body,
1191 * including udp header and folding it to skb->csum.
1192 */
1193 static inline int udp4_csum_init(struct sk_buff *skb, struct udphdr *uh,
1194 int proto)
1195 {
1196 const struct iphdr *iph;
1197 int err;
1198
1199 UDP_SKB_CB(skb)->partial_cov = 0;
1200 UDP_SKB_CB(skb)->cscov = skb->len;
1201
1202 if (proto == IPPROTO_UDPLITE) {
1203 err = udplite_checksum_init(skb, uh);
1204 if (err)
1205 return err;
1206 }
1207
1208 iph = ip_hdr(skb);
1209 if (uh->check == 0) {
1210 skb->ip_summed = CHECKSUM_UNNECESSARY;
1211 } else if (skb->ip_summed == CHECKSUM_COMPLETE) {
1212 if (!csum_tcpudp_magic(iph->saddr, iph->daddr, skb->len,
1213 proto, skb->csum))
1214 skb->ip_summed = CHECKSUM_UNNECESSARY;
1215 }
1216 if (!skb_csum_unnecessary(skb))
1217 skb->csum = csum_tcpudp_nofold(iph->saddr, iph->daddr,
1218 skb->len, proto, 0);
1219 /* Probably, we should checksum udp header (it should be in cache
1220 * in any case) and data in tiny packets (< rx copybreak).
1221 */
1222
1223 return 0;
1224 }
1225
1226 /*
1227 * All we need to do is get the socket, and then do a checksum.
1228 */
1229
1230 int __udp4_lib_rcv(struct sk_buff *skb, struct udp_table *udptable,
1231 int proto)
1232 {
1233 struct sock *sk;
1234 struct udphdr *uh = udp_hdr(skb);
1235 unsigned short ulen;
1236 struct rtable *rt = (struct rtable*)skb->dst;
1237 __be32 saddr = ip_hdr(skb)->saddr;
1238 __be32 daddr = ip_hdr(skb)->daddr;
1239 struct net *net = dev_net(skb->dev);
1240
1241 /*
1242 * Validate the packet.
1243 */
1244 if (!pskb_may_pull(skb, sizeof(struct udphdr)))
1245 goto drop; /* No space for header. */
1246
1247 ulen = ntohs(uh->len);
1248 if (ulen > skb->len)
1249 goto short_packet;
1250
1251 if (proto == IPPROTO_UDP) {
1252 /* UDP validates ulen. */
1253 if (ulen < sizeof(*uh) || pskb_trim_rcsum(skb, ulen))
1254 goto short_packet;
1255 uh = udp_hdr(skb);
1256 }
1257
1258 if (udp4_csum_init(skb, uh, proto))
1259 goto csum_error;
1260
1261 if (rt->rt_flags & (RTCF_BROADCAST|RTCF_MULTICAST))
1262 return __udp4_lib_mcast_deliver(net, skb, uh,
1263 saddr, daddr, udptable);
1264
1265 sk = __udp4_lib_lookup_skb(skb, uh->source, uh->dest, udptable);
1266
1267 if (sk != NULL) {
1268 int ret = udp_queue_rcv_skb(sk, skb);
1269 sock_put(sk);
1270
1271 /* a return value > 0 means to resubmit the input, but
1272 * it wants the return to be -protocol, or 0
1273 */
1274 if (ret > 0)
1275 return -ret;
1276 return 0;
1277 }
1278
1279 if (!xfrm4_policy_check(NULL, XFRM_POLICY_IN, skb))
1280 goto drop;
1281 nf_reset(skb);
1282
1283 /* No socket. Drop packet silently, if checksum is wrong */
1284 if (udp_lib_checksum_complete(skb))
1285 goto csum_error;
1286
1287 UDP_INC_STATS_BH(net, UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE);
1288 icmp_send(skb, ICMP_DEST_UNREACH, ICMP_PORT_UNREACH, 0);
1289
1290 /*
1291 * Hmm. We got an UDP packet to a port to which we
1292 * don't wanna listen. Ignore it.
1293 */
1294 kfree_skb(skb);
1295 return 0;
1296
1297 short_packet:
1298 LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: short packet: From %pI4:%u %d/%d to %pI4:%u\n",
1299 proto == IPPROTO_UDPLITE ? "-Lite" : "",
1300 &saddr,
1301 ntohs(uh->source),
1302 ulen,
1303 skb->len,
1304 &daddr,
1305 ntohs(uh->dest));
1306 goto drop;
1307
1308 csum_error:
1309 /*
1310 * RFC1122: OK. Discards the bad packet silently (as far as
1311 * the network is concerned, anyway) as per 4.1.3.4 (MUST).
1312 */
1313 LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: bad checksum. From %pI4:%u to %pI4:%u ulen %d\n",
1314 proto == IPPROTO_UDPLITE ? "-Lite" : "",
1315 &saddr,
1316 ntohs(uh->source),
1317 &daddr,
1318 ntohs(uh->dest),
1319 ulen);
1320 drop:
1321 UDP_INC_STATS_BH(net, UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE);
1322 kfree_skb(skb);
1323 return 0;
1324 }
1325
1326 int udp_rcv(struct sk_buff *skb)
1327 {
1328 return __udp4_lib_rcv(skb, &udp_table, IPPROTO_UDP);
1329 }
1330
1331 void udp_destroy_sock(struct sock *sk)
1332 {
1333 lock_sock(sk);
1334 udp_flush_pending_frames(sk);
1335 release_sock(sk);
1336 }
1337
1338 /*
1339 * Socket option code for UDP
1340 */
1341 int udp_lib_setsockopt(struct sock *sk, int level, int optname,
1342 char __user *optval, int optlen,
1343 int (*push_pending_frames)(struct sock *))
1344 {
1345 struct udp_sock *up = udp_sk(sk);
1346 int val;
1347 int err = 0;
1348 int is_udplite = IS_UDPLITE(sk);
1349
1350 if (optlen<sizeof(int))
1351 return -EINVAL;
1352
1353 if (get_user(val, (int __user *)optval))
1354 return -EFAULT;
1355
1356 switch (optname) {
1357 case UDP_CORK:
1358 if (val != 0) {
1359 up->corkflag = 1;
1360 } else {
1361 up->corkflag = 0;
1362 lock_sock(sk);
1363 (*push_pending_frames)(sk);
1364 release_sock(sk);
1365 }
1366 break;
1367
1368 case UDP_ENCAP:
1369 switch (val) {
1370 case 0:
1371 case UDP_ENCAP_ESPINUDP:
1372 case UDP_ENCAP_ESPINUDP_NON_IKE:
1373 up->encap_rcv = xfrm4_udp_encap_rcv;
1374 /* FALLTHROUGH */
1375 case UDP_ENCAP_L2TPINUDP:
1376 up->encap_type = val;
1377 break;
1378 default:
1379 err = -ENOPROTOOPT;
1380 break;
1381 }
1382 break;
1383
1384 /*
1385 * UDP-Lite's partial checksum coverage (RFC 3828).
1386 */
1387 /* The sender sets actual checksum coverage length via this option.
1388 * The case coverage > packet length is handled by send module. */
1389 case UDPLITE_SEND_CSCOV:
1390 if (!is_udplite) /* Disable the option on UDP sockets */
1391 return -ENOPROTOOPT;
1392 if (val != 0 && val < 8) /* Illegal coverage: use default (8) */
1393 val = 8;
1394 else if (val > USHORT_MAX)
1395 val = USHORT_MAX;
1396 up->pcslen = val;
1397 up->pcflag |= UDPLITE_SEND_CC;
1398 break;
1399
1400 /* The receiver specifies a minimum checksum coverage value. To make
1401 * sense, this should be set to at least 8 (as done below). If zero is
1402 * used, this again means full checksum coverage. */
1403 case UDPLITE_RECV_CSCOV:
1404 if (!is_udplite) /* Disable the option on UDP sockets */
1405 return -ENOPROTOOPT;
1406 if (val != 0 && val < 8) /* Avoid silly minimal values. */
1407 val = 8;
1408 else if (val > USHORT_MAX)
1409 val = USHORT_MAX;
1410 up->pcrlen = val;
1411 up->pcflag |= UDPLITE_RECV_CC;
1412 break;
1413
1414 default:
1415 err = -ENOPROTOOPT;
1416 break;
1417 }
1418
1419 return err;
1420 }
1421
1422 int udp_setsockopt(struct sock *sk, int level, int optname,
1423 char __user *optval, int optlen)
1424 {
1425 if (level == SOL_UDP || level == SOL_UDPLITE)
1426 return udp_lib_setsockopt(sk, level, optname, optval, optlen,
1427 udp_push_pending_frames);
1428 return ip_setsockopt(sk, level, optname, optval, optlen);
1429 }
1430
1431 #ifdef CONFIG_COMPAT
1432 int compat_udp_setsockopt(struct sock *sk, int level, int optname,
1433 char __user *optval, int optlen)
1434 {
1435 if (level == SOL_UDP || level == SOL_UDPLITE)
1436 return udp_lib_setsockopt(sk, level, optname, optval, optlen,
1437 udp_push_pending_frames);
1438 return compat_ip_setsockopt(sk, level, optname, optval, optlen);
1439 }
1440 #endif
1441
1442 int udp_lib_getsockopt(struct sock *sk, int level, int optname,
1443 char __user *optval, int __user *optlen)
1444 {
1445 struct udp_sock *up = udp_sk(sk);
1446 int val, len;
1447
1448 if (get_user(len,optlen))
1449 return -EFAULT;
1450
1451 len = min_t(unsigned int, len, sizeof(int));
1452
1453 if (len < 0)
1454 return -EINVAL;
1455
1456 switch (optname) {
1457 case UDP_CORK:
1458 val = up->corkflag;
1459 break;
1460
1461 case UDP_ENCAP:
1462 val = up->encap_type;
1463 break;
1464
1465 /* The following two cannot be changed on UDP sockets, the return is
1466 * always 0 (which corresponds to the full checksum coverage of UDP). */
1467 case UDPLITE_SEND_CSCOV:
1468 val = up->pcslen;
1469 break;
1470
1471 case UDPLITE_RECV_CSCOV:
1472 val = up->pcrlen;
1473 break;
1474
1475 default:
1476 return -ENOPROTOOPT;
1477 }
1478
1479 if (put_user(len, optlen))
1480 return -EFAULT;
1481 if (copy_to_user(optval, &val,len))
1482 return -EFAULT;
1483 return 0;
1484 }
1485
1486 int udp_getsockopt(struct sock *sk, int level, int optname,
1487 char __user *optval, int __user *optlen)
1488 {
1489 if (level == SOL_UDP || level == SOL_UDPLITE)
1490 return udp_lib_getsockopt(sk, level, optname, optval, optlen);
1491 return ip_getsockopt(sk, level, optname, optval, optlen);
1492 }
1493
1494 #ifdef CONFIG_COMPAT
1495 int compat_udp_getsockopt(struct sock *sk, int level, int optname,
1496 char __user *optval, int __user *optlen)
1497 {
1498 if (level == SOL_UDP || level == SOL_UDPLITE)
1499 return udp_lib_getsockopt(sk, level, optname, optval, optlen);
1500 return compat_ip_getsockopt(sk, level, optname, optval, optlen);
1501 }
1502 #endif
1503 /**
1504 * udp_poll - wait for a UDP event.
1505 * @file - file struct
1506 * @sock - socket
1507 * @wait - poll table
1508 *
1509 * This is same as datagram poll, except for the special case of
1510 * blocking sockets. If application is using a blocking fd
1511 * and a packet with checksum error is in the queue;
1512 * then it could get return from select indicating data available
1513 * but then block when reading it. Add special case code
1514 * to work around these arguably broken applications.
1515 */
1516 unsigned int udp_poll(struct file *file, struct socket *sock, poll_table *wait)
1517 {
1518 unsigned int mask = datagram_poll(file, sock, wait);
1519 struct sock *sk = sock->sk;
1520 int is_lite = IS_UDPLITE(sk);
1521
1522 /* Check for false positives due to checksum errors */
1523 if ( (mask & POLLRDNORM) &&
1524 !(file->f_flags & O_NONBLOCK) &&
1525 !(sk->sk_shutdown & RCV_SHUTDOWN)){
1526 struct sk_buff_head *rcvq = &sk->sk_receive_queue;
1527 struct sk_buff *skb;
1528
1529 spin_lock_bh(&rcvq->lock);
1530 while ((skb = skb_peek(rcvq)) != NULL &&
1531 udp_lib_checksum_complete(skb)) {
1532 UDP_INC_STATS_BH(sock_net(sk),
1533 UDP_MIB_INERRORS, is_lite);
1534 __skb_unlink(skb, rcvq);
1535 kfree_skb(skb);
1536 }
1537 spin_unlock_bh(&rcvq->lock);
1538
1539 /* nothing to see, move along */
1540 if (skb == NULL)
1541 mask &= ~(POLLIN | POLLRDNORM);
1542 }
1543
1544 return mask;
1545
1546 }
1547
1548 struct proto udp_prot = {
1549 .name = "UDP",
1550 .owner = THIS_MODULE,
1551 .close = udp_lib_close,
1552 .connect = ip4_datagram_connect,
1553 .disconnect = udp_disconnect,
1554 .ioctl = udp_ioctl,
1555 .destroy = udp_destroy_sock,
1556 .setsockopt = udp_setsockopt,
1557 .getsockopt = udp_getsockopt,
1558 .sendmsg = udp_sendmsg,
1559 .recvmsg = udp_recvmsg,
1560 .sendpage = udp_sendpage,
1561 .backlog_rcv = __udp_queue_rcv_skb,
1562 .hash = udp_lib_hash,
1563 .unhash = udp_lib_unhash,
1564 .get_port = udp_v4_get_port,
1565 .memory_allocated = &udp_memory_allocated,
1566 .sysctl_mem = sysctl_udp_mem,
1567 .sysctl_wmem = &sysctl_udp_wmem_min,
1568 .sysctl_rmem = &sysctl_udp_rmem_min,
1569 .obj_size = sizeof(struct udp_sock),
1570 .slab_flags = SLAB_DESTROY_BY_RCU,
1571 .h.udp_table = &udp_table,
1572 #ifdef CONFIG_COMPAT
1573 .compat_setsockopt = compat_udp_setsockopt,
1574 .compat_getsockopt = compat_udp_getsockopt,
1575 #endif
1576 };
1577
1578 /* ------------------------------------------------------------------------ */
1579 #ifdef CONFIG_PROC_FS
1580
1581 static struct sock *udp_get_first(struct seq_file *seq, int start)
1582 {
1583 struct sock *sk;
1584 struct udp_iter_state *state = seq->private;
1585 struct net *net = seq_file_net(seq);
1586
1587 for (state->bucket = start; state->bucket < UDP_HTABLE_SIZE; ++state->bucket) {
1588 struct hlist_nulls_node *node;
1589 struct udp_hslot *hslot = &state->udp_table->hash[state->bucket];
1590 spin_lock_bh(&hslot->lock);
1591 sk_nulls_for_each(sk, node, &hslot->head) {
1592 if (!net_eq(sock_net(sk), net))
1593 continue;
1594 if (sk->sk_family == state->family)
1595 goto found;
1596 }
1597 spin_unlock_bh(&hslot->lock);
1598 }
1599 sk = NULL;
1600 found:
1601 return sk;
1602 }
1603
1604 static struct sock *udp_get_next(struct seq_file *seq, struct sock *sk)
1605 {
1606 struct udp_iter_state *state = seq->private;
1607 struct net *net = seq_file_net(seq);
1608
1609 do {
1610 sk = sk_nulls_next(sk);
1611 } while (sk && (!net_eq(sock_net(sk), net) || sk->sk_family != state->family));
1612
1613 if (!sk) {
1614 spin_unlock_bh(&state->udp_table->hash[state->bucket].lock);
1615 return udp_get_first(seq, state->bucket + 1);
1616 }
1617 return sk;
1618 }
1619
1620 static struct sock *udp_get_idx(struct seq_file *seq, loff_t pos)
1621 {
1622 struct sock *sk = udp_get_first(seq, 0);
1623
1624 if (sk)
1625 while (pos && (sk = udp_get_next(seq, sk)) != NULL)
1626 --pos;
1627 return pos ? NULL : sk;
1628 }
1629
1630 static void *udp_seq_start(struct seq_file *seq, loff_t *pos)
1631 {
1632 return *pos ? udp_get_idx(seq, *pos-1) : SEQ_START_TOKEN;
1633 }
1634
1635 static void *udp_seq_next(struct seq_file *seq, void *v, loff_t *pos)
1636 {
1637 struct sock *sk;
1638
1639 if (v == SEQ_START_TOKEN)
1640 sk = udp_get_idx(seq, 0);
1641 else
1642 sk = udp_get_next(seq, v);
1643
1644 ++*pos;
1645 return sk;
1646 }
1647
1648 static void udp_seq_stop(struct seq_file *seq, void *v)
1649 {
1650 struct udp_iter_state *state = seq->private;
1651
1652 if (state->bucket < UDP_HTABLE_SIZE)
1653 spin_unlock_bh(&state->udp_table->hash[state->bucket].lock);
1654 }
1655
1656 static int udp_seq_open(struct inode *inode, struct file *file)
1657 {
1658 struct udp_seq_afinfo *afinfo = PDE(inode)->data;
1659 struct udp_iter_state *s;
1660 int err;
1661
1662 err = seq_open_net(inode, file, &afinfo->seq_ops,
1663 sizeof(struct udp_iter_state));
1664 if (err < 0)
1665 return err;
1666
1667 s = ((struct seq_file *)file->private_data)->private;
1668 s->family = afinfo->family;
1669 s->udp_table = afinfo->udp_table;
1670 return err;
1671 }
1672
1673 /* ------------------------------------------------------------------------ */
1674 int udp_proc_register(struct net *net, struct udp_seq_afinfo *afinfo)
1675 {
1676 struct proc_dir_entry *p;
1677 int rc = 0;
1678
1679 afinfo->seq_fops.open = udp_seq_open;
1680 afinfo->seq_fops.read = seq_read;
1681 afinfo->seq_fops.llseek = seq_lseek;
1682 afinfo->seq_fops.release = seq_release_net;
1683
1684 afinfo->seq_ops.start = udp_seq_start;
1685 afinfo->seq_ops.next = udp_seq_next;
1686 afinfo->seq_ops.stop = udp_seq_stop;
1687
1688 p = proc_create_data(afinfo->name, S_IRUGO, net->proc_net,
1689 &afinfo->seq_fops, afinfo);
1690 if (!p)
1691 rc = -ENOMEM;
1692 return rc;
1693 }
1694
1695 void udp_proc_unregister(struct net *net, struct udp_seq_afinfo *afinfo)
1696 {
1697 proc_net_remove(net, afinfo->name);
1698 }
1699
1700 /* ------------------------------------------------------------------------ */
1701 static void udp4_format_sock(struct sock *sp, struct seq_file *f,
1702 int bucket, int *len)
1703 {
1704 struct inet_sock *inet = inet_sk(sp);
1705 __be32 dest = inet->daddr;
1706 __be32 src = inet->rcv_saddr;
1707 __u16 destp = ntohs(inet->dport);
1708 __u16 srcp = ntohs(inet->sport);
1709
1710 seq_printf(f, "%4d: %08X:%04X %08X:%04X"
1711 " %02X %08X:%08X %02X:%08lX %08X %5d %8d %lu %d %p %d%n",
1712 bucket, src, srcp, dest, destp, sp->sk_state,
1713 atomic_read(&sp->sk_wmem_alloc),
1714 atomic_read(&sp->sk_rmem_alloc),
1715 0, 0L, 0, sock_i_uid(sp), 0, sock_i_ino(sp),
1716 atomic_read(&sp->sk_refcnt), sp,
1717 atomic_read(&sp->sk_drops), len);
1718 }
1719
1720 int udp4_seq_show(struct seq_file *seq, void *v)
1721 {
1722 if (v == SEQ_START_TOKEN)
1723 seq_printf(seq, "%-127s\n",
1724 " sl local_address rem_address st tx_queue "
1725 "rx_queue tr tm->when retrnsmt uid timeout "
1726 "inode ref pointer drops");
1727 else {
1728 struct udp_iter_state *state = seq->private;
1729 int len;
1730
1731 udp4_format_sock(v, seq, state->bucket, &len);
1732 seq_printf(seq, "%*s\n", 127 - len ,"");
1733 }
1734 return 0;
1735 }
1736
1737 /* ------------------------------------------------------------------------ */
1738 static struct udp_seq_afinfo udp4_seq_afinfo = {
1739 .name = "udp",
1740 .family = AF_INET,
1741 .udp_table = &udp_table,
1742 .seq_fops = {
1743 .owner = THIS_MODULE,
1744 },
1745 .seq_ops = {
1746 .show = udp4_seq_show,
1747 },
1748 };
1749
1750 static int udp4_proc_init_net(struct net *net)
1751 {
1752 return udp_proc_register(net, &udp4_seq_afinfo);
1753 }
1754
1755 static void udp4_proc_exit_net(struct net *net)
1756 {
1757 udp_proc_unregister(net, &udp4_seq_afinfo);
1758 }
1759
1760 static struct pernet_operations udp4_net_ops = {
1761 .init = udp4_proc_init_net,
1762 .exit = udp4_proc_exit_net,
1763 };
1764
1765 int __init udp4_proc_init(void)
1766 {
1767 return register_pernet_subsys(&udp4_net_ops);
1768 }
1769
1770 void udp4_proc_exit(void)
1771 {
1772 unregister_pernet_subsys(&udp4_net_ops);
1773 }
1774 #endif /* CONFIG_PROC_FS */
1775
1776 void __init udp_table_init(struct udp_table *table)
1777 {
1778 int i;
1779
1780 for (i = 0; i < UDP_HTABLE_SIZE; i++) {
1781 INIT_HLIST_NULLS_HEAD(&table->hash[i].head, i);
1782 spin_lock_init(&table->hash[i].lock);
1783 }
1784 }
1785
1786 void __init udp_init(void)
1787 {
1788 unsigned long nr_pages, limit;
1789
1790 udp_table_init(&udp_table);
1791 /* Set the pressure threshold up by the same strategy of TCP. It is a
1792 * fraction of global memory that is up to 1/2 at 256 MB, decreasing
1793 * toward zero with the amount of memory, with a floor of 128 pages.
1794 */
1795 nr_pages = totalram_pages - totalhigh_pages;
1796 limit = min(nr_pages, 1UL<<(28-PAGE_SHIFT)) >> (20-PAGE_SHIFT);
1797 limit = (limit * (nr_pages >> (20-PAGE_SHIFT))) >> (PAGE_SHIFT-11);
1798 limit = max(limit, 128UL);
1799 sysctl_udp_mem[0] = limit / 4 * 3;
1800 sysctl_udp_mem[1] = limit;
1801 sysctl_udp_mem[2] = sysctl_udp_mem[0] * 2;
1802
1803 sysctl_udp_rmem_min = SK_MEM_QUANTUM;
1804 sysctl_udp_wmem_min = SK_MEM_QUANTUM;
1805 }
1806
1807 EXPORT_SYMBOL(udp_disconnect);
1808 EXPORT_SYMBOL(udp_ioctl);
1809 EXPORT_SYMBOL(udp_prot);
1810 EXPORT_SYMBOL(udp_sendmsg);
1811 EXPORT_SYMBOL(udp_lib_getsockopt);
1812 EXPORT_SYMBOL(udp_lib_setsockopt);
1813 EXPORT_SYMBOL(udp_poll);
1814 EXPORT_SYMBOL(udp_lib_get_port);
1815
1816 #ifdef CONFIG_PROC_FS
1817 EXPORT_SYMBOL(udp_proc_register);
1818 EXPORT_SYMBOL(udp_proc_unregister);
1819 #endif
kernel source for telekom puls (alcatel/mediatek)