Loading...
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * INET An implementation of the TCP/IP protocol suite for the LINUX
4 * operating system. INET is implemented using the BSD Socket
5 * interface as the means of communication with the user level.
6 *
7 * The User Datagram Protocol (UDP).
8 *
9 * Authors: Ross Biro
10 * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
11 * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
12 * Alan Cox, <alan@lxorguk.ukuu.org.uk>
13 * Hirokazu Takahashi, <taka@valinux.co.jp>
14 *
15 * Fixes:
16 * Alan Cox : verify_area() calls
17 * Alan Cox : stopped close while in use off icmp
18 * messages. Not a fix but a botch that
19 * for udp at least is 'valid'.
20 * Alan Cox : Fixed icmp handling properly
21 * Alan Cox : Correct error for oversized datagrams
22 * Alan Cox : Tidied select() semantics.
23 * Alan Cox : udp_err() fixed properly, also now
24 * select and read wake correctly on errors
25 * Alan Cox : udp_send verify_area moved to avoid mem leak
26 * Alan Cox : UDP can count its memory
27 * Alan Cox : send to an unknown connection causes
28 * an ECONNREFUSED off the icmp, but
29 * does NOT close.
30 * Alan Cox : Switched to new sk_buff handlers. No more backlog!
31 * Alan Cox : Using generic datagram code. Even smaller and the PEEK
32 * bug no longer crashes it.
33 * Fred Van Kempen : Net2e support for sk->broadcast.
34 * Alan Cox : Uses skb_free_datagram
35 * Alan Cox : Added get/set sockopt support.
36 * Alan Cox : Broadcasting without option set returns EACCES.
37 * Alan Cox : No wakeup calls. Instead we now use the callbacks.
38 * Alan Cox : Use ip_tos and ip_ttl
39 * Alan Cox : SNMP Mibs
40 * Alan Cox : MSG_DONTROUTE, and 0.0.0.0 support.
41 * Matt Dillon : UDP length checks.
42 * Alan Cox : Smarter af_inet used properly.
43 * Alan Cox : Use new kernel side addressing.
44 * Alan Cox : Incorrect return on truncated datagram receive.
45 * Arnt Gulbrandsen : New udp_send and stuff
46 * Alan Cox : Cache last socket
47 * Alan Cox : Route cache
48 * Jon Peatfield : Minor efficiency fix to sendto().
49 * Mike Shaver : RFC1122 checks.
50 * Alan Cox : Nonblocking error fix.
51 * Willy Konynenberg : Transparent proxying support.
52 * Mike McLagan : Routing by source
53 * David S. Miller : New socket lookup architecture.
54 * Last socket cache retained as it
55 * does have a high hit rate.
56 * Olaf Kirch : Don't linearise iovec on sendmsg.
57 * Andi Kleen : Some cleanups, cache destination entry
58 * for connect.
59 * Vitaly E. Lavrov : Transparent proxy revived after year coma.
60 * Melvin Smith : Check msg_name not msg_namelen in sendto(),
61 * return ENOTCONN for unconnected sockets (POSIX)
62 * Janos Farkas : don't deliver multi/broadcasts to a different
63 * bound-to-device socket
64 * Hirokazu Takahashi : HW checksumming for outgoing UDP
65 * datagrams.
66 * Hirokazu Takahashi : sendfile() on UDP works now.
67 * Arnaldo C. Melo : convert /proc/net/udp to seq_file
68 * YOSHIFUJI Hideaki @USAGI and: Support IPV6_V6ONLY socket option, which
69 * Alexey Kuznetsov: allow both IPv4 and IPv6 sockets to bind
70 * a single port at the same time.
71 * Derek Atkins <derek@ihtfp.com>: Add Encapulation Support
72 * James Chapman : Add L2TP encapsulation type.
73 */
74
75#define pr_fmt(fmt) "UDP: " fmt
76
77#include <linux/uaccess.h>
78#include <asm/ioctls.h>
79#include <linux/memblock.h>
80#include <linux/highmem.h>
81#include <linux/swap.h>
82#include <linux/types.h>
83#include <linux/fcntl.h>
84#include <linux/module.h>
85#include <linux/socket.h>
86#include <linux/sockios.h>
87#include <linux/igmp.h>
88#include <linux/inetdevice.h>
89#include <linux/in.h>
90#include <linux/errno.h>
91#include <linux/timer.h>
92#include <linux/mm.h>
93#include <linux/inet.h>
94#include <linux/netdevice.h>
95#include <linux/slab.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/inet_hashtables.h>
103#include <net/ip_tunnels.h>
104#include <net/route.h>
105#include <net/checksum.h>
106#include <net/xfrm.h>
107#include <trace/events/udp.h>
108#include <linux/static_key.h>
109#include <trace/events/skb.h>
110#include <net/busy_poll.h>
111#include "udp_impl.h"
112#include <net/sock_reuseport.h>
113#include <net/addrconf.h>
114#include <net/udp_tunnel.h>
115
116struct udp_table udp_table __read_mostly;
117EXPORT_SYMBOL(udp_table);
118
119long sysctl_udp_mem[3] __read_mostly;
120EXPORT_SYMBOL(sysctl_udp_mem);
121
122atomic_long_t udp_memory_allocated;
123EXPORT_SYMBOL(udp_memory_allocated);
124
125#define MAX_UDP_PORTS 65536
126#define PORTS_PER_CHAIN (MAX_UDP_PORTS / UDP_HTABLE_SIZE_MIN)
127
128static int udp_lib_lport_inuse(struct net *net, __u16 num,
129 const struct udp_hslot *hslot,
130 unsigned long *bitmap,
131 struct sock *sk, unsigned int log)
132{
133 struct sock *sk2;
134 kuid_t uid = sock_i_uid(sk);
135
136 sk_for_each(sk2, &hslot->head) {
137 if (net_eq(sock_net(sk2), net) &&
138 sk2 != sk &&
139 (bitmap || udp_sk(sk2)->udp_port_hash == num) &&
140 (!sk2->sk_reuse || !sk->sk_reuse) &&
141 (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if ||
142 sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
143 inet_rcv_saddr_equal(sk, sk2, true)) {
144 if (sk2->sk_reuseport && sk->sk_reuseport &&
145 !rcu_access_pointer(sk->sk_reuseport_cb) &&
146 uid_eq(uid, sock_i_uid(sk2))) {
147 if (!bitmap)
148 return 0;
149 } else {
150 if (!bitmap)
151 return 1;
152 __set_bit(udp_sk(sk2)->udp_port_hash >> log,
153 bitmap);
154 }
155 }
156 }
157 return 0;
158}
159
160/*
161 * Note: we still hold spinlock of primary hash chain, so no other writer
162 * can insert/delete a socket with local_port == num
163 */
164static int udp_lib_lport_inuse2(struct net *net, __u16 num,
165 struct udp_hslot *hslot2,
166 struct sock *sk)
167{
168 struct sock *sk2;
169 kuid_t uid = sock_i_uid(sk);
170 int res = 0;
171
172 spin_lock(&hslot2->lock);
173 udp_portaddr_for_each_entry(sk2, &hslot2->head) {
174 if (net_eq(sock_net(sk2), net) &&
175 sk2 != sk &&
176 (udp_sk(sk2)->udp_port_hash == num) &&
177 (!sk2->sk_reuse || !sk->sk_reuse) &&
178 (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if ||
179 sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
180 inet_rcv_saddr_equal(sk, sk2, true)) {
181 if (sk2->sk_reuseport && sk->sk_reuseport &&
182 !rcu_access_pointer(sk->sk_reuseport_cb) &&
183 uid_eq(uid, sock_i_uid(sk2))) {
184 res = 0;
185 } else {
186 res = 1;
187 }
188 break;
189 }
190 }
191 spin_unlock(&hslot2->lock);
192 return res;
193}
194
195static int udp_reuseport_add_sock(struct sock *sk, struct udp_hslot *hslot)
196{
197 struct net *net = sock_net(sk);
198 kuid_t uid = sock_i_uid(sk);
199 struct sock *sk2;
200
201 sk_for_each(sk2, &hslot->head) {
202 if (net_eq(sock_net(sk2), net) &&
203 sk2 != sk &&
204 sk2->sk_family == sk->sk_family &&
205 ipv6_only_sock(sk2) == ipv6_only_sock(sk) &&
206 (udp_sk(sk2)->udp_port_hash == udp_sk(sk)->udp_port_hash) &&
207 (sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
208 sk2->sk_reuseport && uid_eq(uid, sock_i_uid(sk2)) &&
209 inet_rcv_saddr_equal(sk, sk2, false)) {
210 return reuseport_add_sock(sk, sk2,
211 inet_rcv_saddr_any(sk));
212 }
213 }
214
215 return reuseport_alloc(sk, inet_rcv_saddr_any(sk));
216}
217
218/**
219 * udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
220 *
221 * @sk: socket struct in question
222 * @snum: port number to look up
223 * @hash2_nulladdr: AF-dependent hash value in secondary hash chains,
224 * with NULL address
225 */
226int udp_lib_get_port(struct sock *sk, unsigned short snum,
227 unsigned int hash2_nulladdr)
228{
229 struct udp_hslot *hslot, *hslot2;
230 struct udp_table *udptable = sk->sk_prot->h.udp_table;
231 int error = 1;
232 struct net *net = sock_net(sk);
233
234 if (!snum) {
235 int low, high, remaining;
236 unsigned int rand;
237 unsigned short first, last;
238 DECLARE_BITMAP(bitmap, PORTS_PER_CHAIN);
239
240 inet_get_local_port_range(net, &low, &high);
241 remaining = (high - low) + 1;
242
243 rand = prandom_u32();
244 first = reciprocal_scale(rand, remaining) + low;
245 /*
246 * force rand to be an odd multiple of UDP_HTABLE_SIZE
247 */
248 rand = (rand | 1) * (udptable->mask + 1);
249 last = first + udptable->mask + 1;
250 do {
251 hslot = udp_hashslot(udptable, net, first);
252 bitmap_zero(bitmap, PORTS_PER_CHAIN);
253 spin_lock_bh(&hslot->lock);
254 udp_lib_lport_inuse(net, snum, hslot, bitmap, sk,
255 udptable->log);
256
257 snum = first;
258 /*
259 * Iterate on all possible values of snum for this hash.
260 * Using steps of an odd multiple of UDP_HTABLE_SIZE
261 * give us randomization and full range coverage.
262 */
263 do {
264 if (low <= snum && snum <= high &&
265 !test_bit(snum >> udptable->log, bitmap) &&
266 !inet_is_local_reserved_port(net, snum))
267 goto found;
268 snum += rand;
269 } while (snum != first);
270 spin_unlock_bh(&hslot->lock);
271 cond_resched();
272 } while (++first != last);
273 goto fail;
274 } else {
275 hslot = udp_hashslot(udptable, net, snum);
276 spin_lock_bh(&hslot->lock);
277 if (hslot->count > 10) {
278 int exist;
279 unsigned int slot2 = udp_sk(sk)->udp_portaddr_hash ^ snum;
280
281 slot2 &= udptable->mask;
282 hash2_nulladdr &= udptable->mask;
283
284 hslot2 = udp_hashslot2(udptable, slot2);
285 if (hslot->count < hslot2->count)
286 goto scan_primary_hash;
287
288 exist = udp_lib_lport_inuse2(net, snum, hslot2, sk);
289 if (!exist && (hash2_nulladdr != slot2)) {
290 hslot2 = udp_hashslot2(udptable, hash2_nulladdr);
291 exist = udp_lib_lport_inuse2(net, snum, hslot2,
292 sk);
293 }
294 if (exist)
295 goto fail_unlock;
296 else
297 goto found;
298 }
299scan_primary_hash:
300 if (udp_lib_lport_inuse(net, snum, hslot, NULL, sk, 0))
301 goto fail_unlock;
302 }
303found:
304 inet_sk(sk)->inet_num = snum;
305 udp_sk(sk)->udp_port_hash = snum;
306 udp_sk(sk)->udp_portaddr_hash ^= snum;
307 if (sk_unhashed(sk)) {
308 if (sk->sk_reuseport &&
309 udp_reuseport_add_sock(sk, hslot)) {
310 inet_sk(sk)->inet_num = 0;
311 udp_sk(sk)->udp_port_hash = 0;
312 udp_sk(sk)->udp_portaddr_hash ^= snum;
313 goto fail_unlock;
314 }
315
316 sk_add_node_rcu(sk, &hslot->head);
317 hslot->count++;
318 sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1);
319
320 hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
321 spin_lock(&hslot2->lock);
322 if (IS_ENABLED(CONFIG_IPV6) && sk->sk_reuseport &&
323 sk->sk_family == AF_INET6)
324 hlist_add_tail_rcu(&udp_sk(sk)->udp_portaddr_node,
325 &hslot2->head);
326 else
327 hlist_add_head_rcu(&udp_sk(sk)->udp_portaddr_node,
328 &hslot2->head);
329 hslot2->count++;
330 spin_unlock(&hslot2->lock);
331 }
332 sock_set_flag(sk, SOCK_RCU_FREE);
333 error = 0;
334fail_unlock:
335 spin_unlock_bh(&hslot->lock);
336fail:
337 return error;
338}
339EXPORT_SYMBOL(udp_lib_get_port);
340
341int udp_v4_get_port(struct sock *sk, unsigned short snum)
342{
343 unsigned int hash2_nulladdr =
344 ipv4_portaddr_hash(sock_net(sk), htonl(INADDR_ANY), snum);
345 unsigned int hash2_partial =
346 ipv4_portaddr_hash(sock_net(sk), inet_sk(sk)->inet_rcv_saddr, 0);
347
348 /* precompute partial secondary hash */
349 udp_sk(sk)->udp_portaddr_hash = hash2_partial;
350 return udp_lib_get_port(sk, snum, hash2_nulladdr);
351}
352
353static int compute_score(struct sock *sk, struct net *net,
354 __be32 saddr, __be16 sport,
355 __be32 daddr, unsigned short hnum,
356 int dif, int sdif)
357{
358 int score;
359 struct inet_sock *inet;
360 bool dev_match;
361
362 if (!net_eq(sock_net(sk), net) ||
363 udp_sk(sk)->udp_port_hash != hnum ||
364 ipv6_only_sock(sk))
365 return -1;
366
367 if (sk->sk_rcv_saddr != daddr)
368 return -1;
369
370 score = (sk->sk_family == PF_INET) ? 2 : 1;
371
372 inet = inet_sk(sk);
373 if (inet->inet_daddr) {
374 if (inet->inet_daddr != saddr)
375 return -1;
376 score += 4;
377 }
378
379 if (inet->inet_dport) {
380 if (inet->inet_dport != sport)
381 return -1;
382 score += 4;
383 }
384
385 dev_match = udp_sk_bound_dev_eq(net, sk->sk_bound_dev_if,
386 dif, sdif);
387 if (!dev_match)
388 return -1;
389 score += 4;
390
391 if (READ_ONCE(sk->sk_incoming_cpu) == raw_smp_processor_id())
392 score++;
393 return score;
394}
395
396static u32 udp_ehashfn(const struct net *net, const __be32 laddr,
397 const __u16 lport, const __be32 faddr,
398 const __be16 fport)
399{
400 static u32 udp_ehash_secret __read_mostly;
401
402 net_get_random_once(&udp_ehash_secret, sizeof(udp_ehash_secret));
403
404 return __inet_ehashfn(laddr, lport, faddr, fport,
405 udp_ehash_secret + net_hash_mix(net));
406}
407
408/* called with rcu_read_lock() */
409static struct sock *udp4_lib_lookup2(struct net *net,
410 __be32 saddr, __be16 sport,
411 __be32 daddr, unsigned int hnum,
412 int dif, int sdif,
413 struct udp_hslot *hslot2,
414 struct sk_buff *skb)
415{
416 struct sock *sk, *result;
417 int score, badness;
418 u32 hash = 0;
419
420 result = NULL;
421 badness = 0;
422 udp_portaddr_for_each_entry_rcu(sk, &hslot2->head) {
423 score = compute_score(sk, net, saddr, sport,
424 daddr, hnum, dif, sdif);
425 if (score > badness) {
426 if (sk->sk_reuseport &&
427 sk->sk_state != TCP_ESTABLISHED) {
428 hash = udp_ehashfn(net, daddr, hnum,
429 saddr, sport);
430 result = reuseport_select_sock(sk, hash, skb,
431 sizeof(struct udphdr));
432 if (result && !reuseport_has_conns(sk, false))
433 return result;
434 }
435 badness = score;
436 result = sk;
437 }
438 }
439 return result;
440}
441
442/* UDP is nearly always wildcards out the wazoo, it makes no sense to try
443 * harder than this. -DaveM
444 */
445struct sock *__udp4_lib_lookup(struct net *net, __be32 saddr,
446 __be16 sport, __be32 daddr, __be16 dport, int dif,
447 int sdif, struct udp_table *udptable, struct sk_buff *skb)
448{
449 struct sock *result;
450 unsigned short hnum = ntohs(dport);
451 unsigned int hash2, slot2;
452 struct udp_hslot *hslot2;
453
454 hash2 = ipv4_portaddr_hash(net, daddr, hnum);
455 slot2 = hash2 & udptable->mask;
456 hslot2 = &udptable->hash2[slot2];
457
458 result = udp4_lib_lookup2(net, saddr, sport,
459 daddr, hnum, dif, sdif,
460 hslot2, skb);
461 if (!result) {
462 hash2 = ipv4_portaddr_hash(net, htonl(INADDR_ANY), hnum);
463 slot2 = hash2 & udptable->mask;
464 hslot2 = &udptable->hash2[slot2];
465
466 result = udp4_lib_lookup2(net, saddr, sport,
467 htonl(INADDR_ANY), hnum, dif, sdif,
468 hslot2, skb);
469 }
470 if (IS_ERR(result))
471 return NULL;
472 return result;
473}
474EXPORT_SYMBOL_GPL(__udp4_lib_lookup);
475
476static inline struct sock *__udp4_lib_lookup_skb(struct sk_buff *skb,
477 __be16 sport, __be16 dport,
478 struct udp_table *udptable)
479{
480 const struct iphdr *iph = ip_hdr(skb);
481
482 return __udp4_lib_lookup(dev_net(skb->dev), iph->saddr, sport,
483 iph->daddr, dport, inet_iif(skb),
484 inet_sdif(skb), udptable, skb);
485}
486
487struct sock *udp4_lib_lookup_skb(struct sk_buff *skb,
488 __be16 sport, __be16 dport)
489{
490 const struct iphdr *iph = ip_hdr(skb);
491
492 return __udp4_lib_lookup(dev_net(skb->dev), iph->saddr, sport,
493 iph->daddr, dport, inet_iif(skb),
494 inet_sdif(skb), &udp_table, NULL);
495}
496EXPORT_SYMBOL_GPL(udp4_lib_lookup_skb);
497
498/* Must be called under rcu_read_lock().
499 * Does increment socket refcount.
500 */
501#if IS_ENABLED(CONFIG_NF_TPROXY_IPV4) || IS_ENABLED(CONFIG_NF_SOCKET_IPV4)
502struct sock *udp4_lib_lookup(struct net *net, __be32 saddr, __be16 sport,
503 __be32 daddr, __be16 dport, int dif)
504{
505 struct sock *sk;
506
507 sk = __udp4_lib_lookup(net, saddr, sport, daddr, dport,
508 dif, 0, &udp_table, NULL);
509 if (sk && !refcount_inc_not_zero(&sk->sk_refcnt))
510 sk = NULL;
511 return sk;
512}
513EXPORT_SYMBOL_GPL(udp4_lib_lookup);
514#endif
515
516static inline bool __udp_is_mcast_sock(struct net *net, struct sock *sk,
517 __be16 loc_port, __be32 loc_addr,
518 __be16 rmt_port, __be32 rmt_addr,
519 int dif, int sdif, unsigned short hnum)
520{
521 struct inet_sock *inet = inet_sk(sk);
522
523 if (!net_eq(sock_net(sk), net) ||
524 udp_sk(sk)->udp_port_hash != hnum ||
525 (inet->inet_daddr && inet->inet_daddr != rmt_addr) ||
526 (inet->inet_dport != rmt_port && inet->inet_dport) ||
527 (inet->inet_rcv_saddr && inet->inet_rcv_saddr != loc_addr) ||
528 ipv6_only_sock(sk) ||
529 !udp_sk_bound_dev_eq(net, sk->sk_bound_dev_if, dif, sdif))
530 return false;
531 if (!ip_mc_sf_allow(sk, loc_addr, rmt_addr, dif, sdif))
532 return false;
533 return true;
534}
535
536DEFINE_STATIC_KEY_FALSE(udp_encap_needed_key);
537void udp_encap_enable(void)
538{
539 static_branch_inc(&udp_encap_needed_key);
540}
541EXPORT_SYMBOL(udp_encap_enable);
542
543/* Handler for tunnels with arbitrary destination ports: no socket lookup, go
544 * through error handlers in encapsulations looking for a match.
545 */
546static int __udp4_lib_err_encap_no_sk(struct sk_buff *skb, u32 info)
547{
548 int i;
549
550 for (i = 0; i < MAX_IPTUN_ENCAP_OPS; i++) {
551 int (*handler)(struct sk_buff *skb, u32 info);
552 const struct ip_tunnel_encap_ops *encap;
553
554 encap = rcu_dereference(iptun_encaps[i]);
555 if (!encap)
556 continue;
557 handler = encap->err_handler;
558 if (handler && !handler(skb, info))
559 return 0;
560 }
561
562 return -ENOENT;
563}
564
565/* Try to match ICMP errors to UDP tunnels by looking up a socket without
566 * reversing source and destination port: this will match tunnels that force the
567 * same destination port on both endpoints (e.g. VXLAN, GENEVE). Note that
568 * lwtunnels might actually break this assumption by being configured with
569 * different destination ports on endpoints, in this case we won't be able to
570 * trace ICMP messages back to them.
571 *
572 * If this doesn't match any socket, probe tunnels with arbitrary destination
573 * ports (e.g. FoU, GUE): there, the receiving socket is useless, as the port
574 * we've sent packets to won't necessarily match the local destination port.
575 *
576 * Then ask the tunnel implementation to match the error against a valid
577 * association.
578 *
579 * Return an error if we can't find a match, the socket if we need further
580 * processing, zero otherwise.
581 */
582static struct sock *__udp4_lib_err_encap(struct net *net,
583 const struct iphdr *iph,
584 struct udphdr *uh,
585 struct udp_table *udptable,
586 struct sk_buff *skb, u32 info)
587{
588 int network_offset, transport_offset;
589 struct sock *sk;
590
591 network_offset = skb_network_offset(skb);
592 transport_offset = skb_transport_offset(skb);
593
594 /* Network header needs to point to the outer IPv4 header inside ICMP */
595 skb_reset_network_header(skb);
596
597 /* Transport header needs to point to the UDP header */
598 skb_set_transport_header(skb, iph->ihl << 2);
599
600 sk = __udp4_lib_lookup(net, iph->daddr, uh->source,
601 iph->saddr, uh->dest, skb->dev->ifindex, 0,
602 udptable, NULL);
603 if (sk) {
604 int (*lookup)(struct sock *sk, struct sk_buff *skb);
605 struct udp_sock *up = udp_sk(sk);
606
607 lookup = READ_ONCE(up->encap_err_lookup);
608 if (!lookup || lookup(sk, skb))
609 sk = NULL;
610 }
611
612 if (!sk)
613 sk = ERR_PTR(__udp4_lib_err_encap_no_sk(skb, info));
614
615 skb_set_transport_header(skb, transport_offset);
616 skb_set_network_header(skb, network_offset);
617
618 return sk;
619}
620
621/*
622 * This routine is called by the ICMP module when it gets some
623 * sort of error condition. If err < 0 then the socket should
624 * be closed and the error returned to the user. If err > 0
625 * it's just the icmp type << 8 | icmp code.
626 * Header points to the ip header of the error packet. We move
627 * on past this. Then (as it used to claim before adjustment)
628 * header points to the first 8 bytes of the udp header. We need
629 * to find the appropriate port.
630 */
631
632int __udp4_lib_err(struct sk_buff *skb, u32 info, struct udp_table *udptable)
633{
634 struct inet_sock *inet;
635 const struct iphdr *iph = (const struct iphdr *)skb->data;
636 struct udphdr *uh = (struct udphdr *)(skb->data+(iph->ihl<<2));
637 const int type = icmp_hdr(skb)->type;
638 const int code = icmp_hdr(skb)->code;
639 bool tunnel = false;
640 struct sock *sk;
641 int harderr;
642 int err;
643 struct net *net = dev_net(skb->dev);
644
645 sk = __udp4_lib_lookup(net, iph->daddr, uh->dest,
646 iph->saddr, uh->source, skb->dev->ifindex,
647 inet_sdif(skb), udptable, NULL);
648 if (!sk) {
649 /* No socket for error: try tunnels before discarding */
650 sk = ERR_PTR(-ENOENT);
651 if (static_branch_unlikely(&udp_encap_needed_key)) {
652 sk = __udp4_lib_err_encap(net, iph, uh, udptable, skb,
653 info);
654 if (!sk)
655 return 0;
656 }
657
658 if (IS_ERR(sk)) {
659 __ICMP_INC_STATS(net, ICMP_MIB_INERRORS);
660 return PTR_ERR(sk);
661 }
662
663 tunnel = true;
664 }
665
666 err = 0;
667 harderr = 0;
668 inet = inet_sk(sk);
669
670 switch (type) {
671 default:
672 case ICMP_TIME_EXCEEDED:
673 err = EHOSTUNREACH;
674 break;
675 case ICMP_SOURCE_QUENCH:
676 goto out;
677 case ICMP_PARAMETERPROB:
678 err = EPROTO;
679 harderr = 1;
680 break;
681 case ICMP_DEST_UNREACH:
682 if (code == ICMP_FRAG_NEEDED) { /* Path MTU discovery */
683 ipv4_sk_update_pmtu(skb, sk, info);
684 if (inet->pmtudisc != IP_PMTUDISC_DONT) {
685 err = EMSGSIZE;
686 harderr = 1;
687 break;
688 }
689 goto out;
690 }
691 err = EHOSTUNREACH;
692 if (code <= NR_ICMP_UNREACH) {
693 harderr = icmp_err_convert[code].fatal;
694 err = icmp_err_convert[code].errno;
695 }
696 break;
697 case ICMP_REDIRECT:
698 ipv4_sk_redirect(skb, sk);
699 goto out;
700 }
701
702 /*
703 * RFC1122: OK. Passes ICMP errors back to application, as per
704 * 4.1.3.3.
705 */
706 if (tunnel) {
707 /* ...not for tunnels though: we don't have a sending socket */
708 goto out;
709 }
710 if (!inet->recverr) {
711 if (!harderr || sk->sk_state != TCP_ESTABLISHED)
712 goto out;
713 } else
714 ip_icmp_error(sk, skb, err, uh->dest, info, (u8 *)(uh+1));
715
716 sk->sk_err = err;
717 sk->sk_error_report(sk);
718out:
719 return 0;
720}
721
722int udp_err(struct sk_buff *skb, u32 info)
723{
724 return __udp4_lib_err(skb, info, &udp_table);
725}
726
727/*
728 * Throw away all pending data and cancel the corking. Socket is locked.
729 */
730void udp_flush_pending_frames(struct sock *sk)
731{
732 struct udp_sock *up = udp_sk(sk);
733
734 if (up->pending) {
735 up->len = 0;
736 up->pending = 0;
737 ip_flush_pending_frames(sk);
738 }
739}
740EXPORT_SYMBOL(udp_flush_pending_frames);
741
742/**
743 * udp4_hwcsum - handle outgoing HW checksumming
744 * @skb: sk_buff containing the filled-in UDP header
745 * (checksum field must be zeroed out)
746 * @src: source IP address
747 * @dst: destination IP address
748 */
749void udp4_hwcsum(struct sk_buff *skb, __be32 src, __be32 dst)
750{
751 struct udphdr *uh = udp_hdr(skb);
752 int offset = skb_transport_offset(skb);
753 int len = skb->len - offset;
754 int hlen = len;
755 __wsum csum = 0;
756
757 if (!skb_has_frag_list(skb)) {
758 /*
759 * Only one fragment on the socket.
760 */
761 skb->csum_start = skb_transport_header(skb) - skb->head;
762 skb->csum_offset = offsetof(struct udphdr, check);
763 uh->check = ~csum_tcpudp_magic(src, dst, len,
764 IPPROTO_UDP, 0);
765 } else {
766 struct sk_buff *frags;
767
768 /*
769 * HW-checksum won't work as there are two or more
770 * fragments on the socket so that all csums of sk_buffs
771 * should be together
772 */
773 skb_walk_frags(skb, frags) {
774 csum = csum_add(csum, frags->csum);
775 hlen -= frags->len;
776 }
777
778 csum = skb_checksum(skb, offset, hlen, csum);
779 skb->ip_summed = CHECKSUM_NONE;
780
781 uh->check = csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, csum);
782 if (uh->check == 0)
783 uh->check = CSUM_MANGLED_0;
784 }
785}
786EXPORT_SYMBOL_GPL(udp4_hwcsum);
787
788/* Function to set UDP checksum for an IPv4 UDP packet. This is intended
789 * for the simple case like when setting the checksum for a UDP tunnel.
790 */
791void udp_set_csum(bool nocheck, struct sk_buff *skb,
792 __be32 saddr, __be32 daddr, int len)
793{
794 struct udphdr *uh = udp_hdr(skb);
795
796 if (nocheck) {
797 uh->check = 0;
798 } else if (skb_is_gso(skb)) {
799 uh->check = ~udp_v4_check(len, saddr, daddr, 0);
800 } else if (skb->ip_summed == CHECKSUM_PARTIAL) {
801 uh->check = 0;
802 uh->check = udp_v4_check(len, saddr, daddr, lco_csum(skb));
803 if (uh->check == 0)
804 uh->check = CSUM_MANGLED_0;
805 } else {
806 skb->ip_summed = CHECKSUM_PARTIAL;
807 skb->csum_start = skb_transport_header(skb) - skb->head;
808 skb->csum_offset = offsetof(struct udphdr, check);
809 uh->check = ~udp_v4_check(len, saddr, daddr, 0);
810 }
811}
812EXPORT_SYMBOL(udp_set_csum);
813
814static int udp_send_skb(struct sk_buff *skb, struct flowi4 *fl4,
815 struct inet_cork *cork)
816{
817 struct sock *sk = skb->sk;
818 struct inet_sock *inet = inet_sk(sk);
819 struct udphdr *uh;
820 int err = 0;
821 int is_udplite = IS_UDPLITE(sk);
822 int offset = skb_transport_offset(skb);
823 int len = skb->len - offset;
824 int datalen = len - sizeof(*uh);
825 __wsum csum = 0;
826
827 /*
828 * Create a UDP header
829 */
830 uh = udp_hdr(skb);
831 uh->source = inet->inet_sport;
832 uh->dest = fl4->fl4_dport;
833 uh->len = htons(len);
834 uh->check = 0;
835
836 if (cork->gso_size) {
837 const int hlen = skb_network_header_len(skb) +
838 sizeof(struct udphdr);
839
840 if (hlen + cork->gso_size > cork->fragsize) {
841 kfree_skb(skb);
842 return -EINVAL;
843 }
844 if (skb->len > cork->gso_size * UDP_MAX_SEGMENTS) {
845 kfree_skb(skb);
846 return -EINVAL;
847 }
848 if (sk->sk_no_check_tx) {
849 kfree_skb(skb);
850 return -EINVAL;
851 }
852 if (skb->ip_summed != CHECKSUM_PARTIAL || is_udplite ||
853 dst_xfrm(skb_dst(skb))) {
854 kfree_skb(skb);
855 return -EIO;
856 }
857
858 if (datalen > cork->gso_size) {
859 skb_shinfo(skb)->gso_size = cork->gso_size;
860 skb_shinfo(skb)->gso_type = SKB_GSO_UDP_L4;
861 skb_shinfo(skb)->gso_segs = DIV_ROUND_UP(datalen,
862 cork->gso_size);
863 }
864 goto csum_partial;
865 }
866
867 if (is_udplite) /* UDP-Lite */
868 csum = udplite_csum(skb);
869
870 else if (sk->sk_no_check_tx) { /* UDP csum off */
871
872 skb->ip_summed = CHECKSUM_NONE;
873 goto send;
874
875 } else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */
876csum_partial:
877
878 udp4_hwcsum(skb, fl4->saddr, fl4->daddr);
879 goto send;
880
881 } else
882 csum = udp_csum(skb);
883
884 /* add protocol-dependent pseudo-header */
885 uh->check = csum_tcpudp_magic(fl4->saddr, fl4->daddr, len,
886 sk->sk_protocol, csum);
887 if (uh->check == 0)
888 uh->check = CSUM_MANGLED_0;
889
890send:
891 err = ip_send_skb(sock_net(sk), skb);
892 if (err) {
893 if (err == -ENOBUFS && !inet->recverr) {
894 UDP_INC_STATS(sock_net(sk),
895 UDP_MIB_SNDBUFERRORS, is_udplite);
896 err = 0;
897 }
898 } else
899 UDP_INC_STATS(sock_net(sk),
900 UDP_MIB_OUTDATAGRAMS, is_udplite);
901 return err;
902}
903
904/*
905 * Push out all pending data as one UDP datagram. Socket is locked.
906 */
907int udp_push_pending_frames(struct sock *sk)
908{
909 struct udp_sock *up = udp_sk(sk);
910 struct inet_sock *inet = inet_sk(sk);
911 struct flowi4 *fl4 = &inet->cork.fl.u.ip4;
912 struct sk_buff *skb;
913 int err = 0;
914
915 skb = ip_finish_skb(sk, fl4);
916 if (!skb)
917 goto out;
918
919 err = udp_send_skb(skb, fl4, &inet->cork.base);
920
921out:
922 up->len = 0;
923 up->pending = 0;
924 return err;
925}
926EXPORT_SYMBOL(udp_push_pending_frames);
927
928static int __udp_cmsg_send(struct cmsghdr *cmsg, u16 *gso_size)
929{
930 switch (cmsg->cmsg_type) {
931 case UDP_SEGMENT:
932 if (cmsg->cmsg_len != CMSG_LEN(sizeof(__u16)))
933 return -EINVAL;
934 *gso_size = *(__u16 *)CMSG_DATA(cmsg);
935 return 0;
936 default:
937 return -EINVAL;
938 }
939}
940
941int udp_cmsg_send(struct sock *sk, struct msghdr *msg, u16 *gso_size)
942{
943 struct cmsghdr *cmsg;
944 bool need_ip = false;
945 int err;
946
947 for_each_cmsghdr(cmsg, msg) {
948 if (!CMSG_OK(msg, cmsg))
949 return -EINVAL;
950
951 if (cmsg->cmsg_level != SOL_UDP) {
952 need_ip = true;
953 continue;
954 }
955
956 err = __udp_cmsg_send(cmsg, gso_size);
957 if (err)
958 return err;
959 }
960
961 return need_ip;
962}
963EXPORT_SYMBOL_GPL(udp_cmsg_send);
964
965int udp_sendmsg(struct sock *sk, struct msghdr *msg, size_t len)
966{
967 struct inet_sock *inet = inet_sk(sk);
968 struct udp_sock *up = udp_sk(sk);
969 DECLARE_SOCKADDR(struct sockaddr_in *, usin, msg->msg_name);
970 struct flowi4 fl4_stack;
971 struct flowi4 *fl4;
972 int ulen = len;
973 struct ipcm_cookie ipc;
974 struct rtable *rt = NULL;
975 int free = 0;
976 int connected = 0;
977 __be32 daddr, faddr, saddr;
978 __be16 dport;
979 u8 tos;
980 int err, is_udplite = IS_UDPLITE(sk);
981 int corkreq = up->corkflag || msg->msg_flags&MSG_MORE;
982 int (*getfrag)(void *, char *, int, int, int, struct sk_buff *);
983 struct sk_buff *skb;
984 struct ip_options_data opt_copy;
985
986 if (len > 0xFFFF)
987 return -EMSGSIZE;
988
989 /*
990 * Check the flags.
991 */
992
993 if (msg->msg_flags & MSG_OOB) /* Mirror BSD error message compatibility */
994 return -EOPNOTSUPP;
995
996 getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag;
997
998 fl4 = &inet->cork.fl.u.ip4;
999 if (up->pending) {
1000 /*
1001 * There are pending frames.
1002 * The socket lock must be held while it's corked.
1003 */
1004 lock_sock(sk);
1005 if (likely(up->pending)) {
1006 if (unlikely(up->pending != AF_INET)) {
1007 release_sock(sk);
1008 return -EINVAL;
1009 }
1010 goto do_append_data;
1011 }
1012 release_sock(sk);
1013 }
1014 ulen += sizeof(struct udphdr);
1015
1016 /*
1017 * Get and verify the address.
1018 */
1019 if (usin) {
1020 if (msg->msg_namelen < sizeof(*usin))
1021 return -EINVAL;
1022 if (usin->sin_family != AF_INET) {
1023 if (usin->sin_family != AF_UNSPEC)
1024 return -EAFNOSUPPORT;
1025 }
1026
1027 daddr = usin->sin_addr.s_addr;
1028 dport = usin->sin_port;
1029 if (dport == 0)
1030 return -EINVAL;
1031 } else {
1032 if (sk->sk_state != TCP_ESTABLISHED)
1033 return -EDESTADDRREQ;
1034 daddr = inet->inet_daddr;
1035 dport = inet->inet_dport;
1036 /* Open fast path for connected socket.
1037 Route will not be used, if at least one option is set.
1038 */
1039 connected = 1;
1040 }
1041
1042 ipcm_init_sk(&ipc, inet);
1043 ipc.gso_size = up->gso_size;
1044
1045 if (msg->msg_controllen) {
1046 err = udp_cmsg_send(sk, msg, &ipc.gso_size);
1047 if (err > 0)
1048 err = ip_cmsg_send(sk, msg, &ipc,
1049 sk->sk_family == AF_INET6);
1050 if (unlikely(err < 0)) {
1051 kfree(ipc.opt);
1052 return err;
1053 }
1054 if (ipc.opt)
1055 free = 1;
1056 connected = 0;
1057 }
1058 if (!ipc.opt) {
1059 struct ip_options_rcu *inet_opt;
1060
1061 rcu_read_lock();
1062 inet_opt = rcu_dereference(inet->inet_opt);
1063 if (inet_opt) {
1064 memcpy(&opt_copy, inet_opt,
1065 sizeof(*inet_opt) + inet_opt->opt.optlen);
1066 ipc.opt = &opt_copy.opt;
1067 }
1068 rcu_read_unlock();
1069 }
1070
1071 if (cgroup_bpf_enabled && !connected) {
1072 err = BPF_CGROUP_RUN_PROG_UDP4_SENDMSG_LOCK(sk,
1073 (struct sockaddr *)usin, &ipc.addr);
1074 if (err)
1075 goto out_free;
1076 if (usin) {
1077 if (usin->sin_port == 0) {
1078 /* BPF program set invalid port. Reject it. */
1079 err = -EINVAL;
1080 goto out_free;
1081 }
1082 daddr = usin->sin_addr.s_addr;
1083 dport = usin->sin_port;
1084 }
1085 }
1086
1087 saddr = ipc.addr;
1088 ipc.addr = faddr = daddr;
1089
1090 if (ipc.opt && ipc.opt->opt.srr) {
1091 if (!daddr) {
1092 err = -EINVAL;
1093 goto out_free;
1094 }
1095 faddr = ipc.opt->opt.faddr;
1096 connected = 0;
1097 }
1098 tos = get_rttos(&ipc, inet);
1099 if (sock_flag(sk, SOCK_LOCALROUTE) ||
1100 (msg->msg_flags & MSG_DONTROUTE) ||
1101 (ipc.opt && ipc.opt->opt.is_strictroute)) {
1102 tos |= RTO_ONLINK;
1103 connected = 0;
1104 }
1105
1106 if (ipv4_is_multicast(daddr)) {
1107 if (!ipc.oif || netif_index_is_l3_master(sock_net(sk), ipc.oif))
1108 ipc.oif = inet->mc_index;
1109 if (!saddr)
1110 saddr = inet->mc_addr;
1111 connected = 0;
1112 } else if (!ipc.oif) {
1113 ipc.oif = inet->uc_index;
1114 } else if (ipv4_is_lbcast(daddr) && inet->uc_index) {
1115 /* oif is set, packet is to local broadcast and
1116 * and uc_index is set. oif is most likely set
1117 * by sk_bound_dev_if. If uc_index != oif check if the
1118 * oif is an L3 master and uc_index is an L3 slave.
1119 * If so, we want to allow the send using the uc_index.
1120 */
1121 if (ipc.oif != inet->uc_index &&
1122 ipc.oif == l3mdev_master_ifindex_by_index(sock_net(sk),
1123 inet->uc_index)) {
1124 ipc.oif = inet->uc_index;
1125 }
1126 }
1127
1128 if (connected)
1129 rt = (struct rtable *)sk_dst_check(sk, 0);
1130
1131 if (!rt) {
1132 struct net *net = sock_net(sk);
1133 __u8 flow_flags = inet_sk_flowi_flags(sk);
1134
1135 fl4 = &fl4_stack;
1136
1137 flowi4_init_output(fl4, ipc.oif, ipc.sockc.mark, tos,
1138 RT_SCOPE_UNIVERSE, sk->sk_protocol,
1139 flow_flags,
1140 faddr, saddr, dport, inet->inet_sport,
1141 sk->sk_uid);
1142
1143 security_sk_classify_flow(sk, flowi4_to_flowi(fl4));
1144 rt = ip_route_output_flow(net, fl4, sk);
1145 if (IS_ERR(rt)) {
1146 err = PTR_ERR(rt);
1147 rt = NULL;
1148 if (err == -ENETUNREACH)
1149 IP_INC_STATS(net, IPSTATS_MIB_OUTNOROUTES);
1150 goto out;
1151 }
1152
1153 err = -EACCES;
1154 if ((rt->rt_flags & RTCF_BROADCAST) &&
1155 !sock_flag(sk, SOCK_BROADCAST))
1156 goto out;
1157 if (connected)
1158 sk_dst_set(sk, dst_clone(&rt->dst));
1159 }
1160
1161 if (msg->msg_flags&MSG_CONFIRM)
1162 goto do_confirm;
1163back_from_confirm:
1164
1165 saddr = fl4->saddr;
1166 if (!ipc.addr)
1167 daddr = ipc.addr = fl4->daddr;
1168
1169 /* Lockless fast path for the non-corking case. */
1170 if (!corkreq) {
1171 struct inet_cork cork;
1172
1173 skb = ip_make_skb(sk, fl4, getfrag, msg, ulen,
1174 sizeof(struct udphdr), &ipc, &rt,
1175 &cork, msg->msg_flags);
1176 err = PTR_ERR(skb);
1177 if (!IS_ERR_OR_NULL(skb))
1178 err = udp_send_skb(skb, fl4, &cork);
1179 goto out;
1180 }
1181
1182 lock_sock(sk);
1183 if (unlikely(up->pending)) {
1184 /* The socket is already corked while preparing it. */
1185 /* ... which is an evident application bug. --ANK */
1186 release_sock(sk);
1187
1188 net_dbg_ratelimited("socket already corked\n");
1189 err = -EINVAL;
1190 goto out;
1191 }
1192 /*
1193 * Now cork the socket to pend data.
1194 */
1195 fl4 = &inet->cork.fl.u.ip4;
1196 fl4->daddr = daddr;
1197 fl4->saddr = saddr;
1198 fl4->fl4_dport = dport;
1199 fl4->fl4_sport = inet->inet_sport;
1200 up->pending = AF_INET;
1201
1202do_append_data:
1203 up->len += ulen;
1204 err = ip_append_data(sk, fl4, getfrag, msg, ulen,
1205 sizeof(struct udphdr), &ipc, &rt,
1206 corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags);
1207 if (err)
1208 udp_flush_pending_frames(sk);
1209 else if (!corkreq)
1210 err = udp_push_pending_frames(sk);
1211 else if (unlikely(skb_queue_empty(&sk->sk_write_queue)))
1212 up->pending = 0;
1213 release_sock(sk);
1214
1215out:
1216 ip_rt_put(rt);
1217out_free:
1218 if (free)
1219 kfree(ipc.opt);
1220 if (!err)
1221 return len;
1222 /*
1223 * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
1224 * ENOBUFS might not be good (it's not tunable per se), but otherwise
1225 * we don't have a good statistic (IpOutDiscards but it can be too many
1226 * things). We could add another new stat but at least for now that
1227 * seems like overkill.
1228 */
1229 if (err == -ENOBUFS || test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
1230 UDP_INC_STATS(sock_net(sk),
1231 UDP_MIB_SNDBUFERRORS, is_udplite);
1232 }
1233 return err;
1234
1235do_confirm:
1236 if (msg->msg_flags & MSG_PROBE)
1237 dst_confirm_neigh(&rt->dst, &fl4->daddr);
1238 if (!(msg->msg_flags&MSG_PROBE) || len)
1239 goto back_from_confirm;
1240 err = 0;
1241 goto out;
1242}
1243EXPORT_SYMBOL(udp_sendmsg);
1244
1245int udp_sendpage(struct sock *sk, struct page *page, int offset,
1246 size_t size, int flags)
1247{
1248 struct inet_sock *inet = inet_sk(sk);
1249 struct udp_sock *up = udp_sk(sk);
1250 int ret;
1251
1252 if (flags & MSG_SENDPAGE_NOTLAST)
1253 flags |= MSG_MORE;
1254
1255 if (!up->pending) {
1256 struct msghdr msg = { .msg_flags = flags|MSG_MORE };
1257
1258 /* Call udp_sendmsg to specify destination address which
1259 * sendpage interface can't pass.
1260 * This will succeed only when the socket is connected.
1261 */
1262 ret = udp_sendmsg(sk, &msg, 0);
1263 if (ret < 0)
1264 return ret;
1265 }
1266
1267 lock_sock(sk);
1268
1269 if (unlikely(!up->pending)) {
1270 release_sock(sk);
1271
1272 net_dbg_ratelimited("cork failed\n");
1273 return -EINVAL;
1274 }
1275
1276 ret = ip_append_page(sk, &inet->cork.fl.u.ip4,
1277 page, offset, size, flags);
1278 if (ret == -EOPNOTSUPP) {
1279 release_sock(sk);
1280 return sock_no_sendpage(sk->sk_socket, page, offset,
1281 size, flags);
1282 }
1283 if (ret < 0) {
1284 udp_flush_pending_frames(sk);
1285 goto out;
1286 }
1287
1288 up->len += size;
1289 if (!(up->corkflag || (flags&MSG_MORE)))
1290 ret = udp_push_pending_frames(sk);
1291 if (!ret)
1292 ret = size;
1293out:
1294 release_sock(sk);
1295 return ret;
1296}
1297
1298#define UDP_SKB_IS_STATELESS 0x80000000
1299
1300/* all head states (dst, sk, nf conntrack) except skb extensions are
1301 * cleared by udp_rcv().
1302 *
1303 * We need to preserve secpath, if present, to eventually process
1304 * IP_CMSG_PASSSEC at recvmsg() time.
1305 *
1306 * Other extensions can be cleared.
1307 */
1308static bool udp_try_make_stateless(struct sk_buff *skb)
1309{
1310 if (!skb_has_extensions(skb))
1311 return true;
1312
1313 if (!secpath_exists(skb)) {
1314 skb_ext_reset(skb);
1315 return true;
1316 }
1317
1318 return false;
1319}
1320
1321static void udp_set_dev_scratch(struct sk_buff *skb)
1322{
1323 struct udp_dev_scratch *scratch = udp_skb_scratch(skb);
1324
1325 BUILD_BUG_ON(sizeof(struct udp_dev_scratch) > sizeof(long));
1326 scratch->_tsize_state = skb->truesize;
1327#if BITS_PER_LONG == 64
1328 scratch->len = skb->len;
1329 scratch->csum_unnecessary = !!skb_csum_unnecessary(skb);
1330 scratch->is_linear = !skb_is_nonlinear(skb);
1331#endif
1332 if (udp_try_make_stateless(skb))
1333 scratch->_tsize_state |= UDP_SKB_IS_STATELESS;
1334}
1335
1336static void udp_skb_csum_unnecessary_set(struct sk_buff *skb)
1337{
1338 /* We come here after udp_lib_checksum_complete() returned 0.
1339 * This means that __skb_checksum_complete() might have
1340 * set skb->csum_valid to 1.
1341 * On 64bit platforms, we can set csum_unnecessary
1342 * to true, but only if the skb is not shared.
1343 */
1344#if BITS_PER_LONG == 64
1345 if (!skb_shared(skb))
1346 udp_skb_scratch(skb)->csum_unnecessary = true;
1347#endif
1348}
1349
1350static int udp_skb_truesize(struct sk_buff *skb)
1351{
1352 return udp_skb_scratch(skb)->_tsize_state & ~UDP_SKB_IS_STATELESS;
1353}
1354
1355static bool udp_skb_has_head_state(struct sk_buff *skb)
1356{
1357 return !(udp_skb_scratch(skb)->_tsize_state & UDP_SKB_IS_STATELESS);
1358}
1359
1360/* fully reclaim rmem/fwd memory allocated for skb */
1361static void udp_rmem_release(struct sock *sk, int size, int partial,
1362 bool rx_queue_lock_held)
1363{
1364 struct udp_sock *up = udp_sk(sk);
1365 struct sk_buff_head *sk_queue;
1366 int amt;
1367
1368 if (likely(partial)) {
1369 up->forward_deficit += size;
1370 size = up->forward_deficit;
1371 if (size < (sk->sk_rcvbuf >> 2))
1372 return;
1373 } else {
1374 size += up->forward_deficit;
1375 }
1376 up->forward_deficit = 0;
1377
1378 /* acquire the sk_receive_queue for fwd allocated memory scheduling,
1379 * if the called don't held it already
1380 */
1381 sk_queue = &sk->sk_receive_queue;
1382 if (!rx_queue_lock_held)
1383 spin_lock(&sk_queue->lock);
1384
1385
1386 sk->sk_forward_alloc += size;
1387 amt = (sk->sk_forward_alloc - partial) & ~(SK_MEM_QUANTUM - 1);
1388 sk->sk_forward_alloc -= amt;
1389
1390 if (amt)
1391 __sk_mem_reduce_allocated(sk, amt >> SK_MEM_QUANTUM_SHIFT);
1392
1393 atomic_sub(size, &sk->sk_rmem_alloc);
1394
1395 /* this can save us from acquiring the rx queue lock on next receive */
1396 skb_queue_splice_tail_init(sk_queue, &up->reader_queue);
1397
1398 if (!rx_queue_lock_held)
1399 spin_unlock(&sk_queue->lock);
1400}
1401
1402/* Note: called with reader_queue.lock held.
1403 * Instead of using skb->truesize here, find a copy of it in skb->dev_scratch
1404 * This avoids a cache line miss while receive_queue lock is held.
1405 * Look at __udp_enqueue_schedule_skb() to find where this copy is done.
1406 */
1407void udp_skb_destructor(struct sock *sk, struct sk_buff *skb)
1408{
1409 prefetch(&skb->data);
1410 udp_rmem_release(sk, udp_skb_truesize(skb), 1, false);
1411}
1412EXPORT_SYMBOL(udp_skb_destructor);
1413
1414/* as above, but the caller held the rx queue lock, too */
1415static void udp_skb_dtor_locked(struct sock *sk, struct sk_buff *skb)
1416{
1417 prefetch(&skb->data);
1418 udp_rmem_release(sk, udp_skb_truesize(skb), 1, true);
1419}
1420
1421/* Idea of busylocks is to let producers grab an extra spinlock
1422 * to relieve pressure on the receive_queue spinlock shared by consumer.
1423 * Under flood, this means that only one producer can be in line
1424 * trying to acquire the receive_queue spinlock.
1425 * These busylock can be allocated on a per cpu manner, instead of a
1426 * per socket one (that would consume a cache line per socket)
1427 */
1428static int udp_busylocks_log __read_mostly;
1429static spinlock_t *udp_busylocks __read_mostly;
1430
1431static spinlock_t *busylock_acquire(void *ptr)
1432{
1433 spinlock_t *busy;
1434
1435 busy = udp_busylocks + hash_ptr(ptr, udp_busylocks_log);
1436 spin_lock(busy);
1437 return busy;
1438}
1439
1440static void busylock_release(spinlock_t *busy)
1441{
1442 if (busy)
1443 spin_unlock(busy);
1444}
1445
1446int __udp_enqueue_schedule_skb(struct sock *sk, struct sk_buff *skb)
1447{
1448 struct sk_buff_head *list = &sk->sk_receive_queue;
1449 int rmem, delta, amt, err = -ENOMEM;
1450 spinlock_t *busy = NULL;
1451 int size;
1452
1453 /* try to avoid the costly atomic add/sub pair when the receive
1454 * queue is full; always allow at least a packet
1455 */
1456 rmem = atomic_read(&sk->sk_rmem_alloc);
1457 if (rmem > sk->sk_rcvbuf)
1458 goto drop;
1459
1460 /* Under mem pressure, it might be helpful to help udp_recvmsg()
1461 * having linear skbs :
1462 * - Reduce memory overhead and thus increase receive queue capacity
1463 * - Less cache line misses at copyout() time
1464 * - Less work at consume_skb() (less alien page frag freeing)
1465 */
1466 if (rmem > (sk->sk_rcvbuf >> 1)) {
1467 skb_condense(skb);
1468
1469 busy = busylock_acquire(sk);
1470 }
1471 size = skb->truesize;
1472 udp_set_dev_scratch(skb);
1473
1474 /* we drop only if the receive buf is full and the receive
1475 * queue contains some other skb
1476 */
1477 rmem = atomic_add_return(size, &sk->sk_rmem_alloc);
1478 if (rmem > (size + sk->sk_rcvbuf))
1479 goto uncharge_drop;
1480
1481 spin_lock(&list->lock);
1482 if (size >= sk->sk_forward_alloc) {
1483 amt = sk_mem_pages(size);
1484 delta = amt << SK_MEM_QUANTUM_SHIFT;
1485 if (!__sk_mem_raise_allocated(sk, delta, amt, SK_MEM_RECV)) {
1486 err = -ENOBUFS;
1487 spin_unlock(&list->lock);
1488 goto uncharge_drop;
1489 }
1490
1491 sk->sk_forward_alloc += delta;
1492 }
1493
1494 sk->sk_forward_alloc -= size;
1495
1496 /* no need to setup a destructor, we will explicitly release the
1497 * forward allocated memory on dequeue
1498 */
1499 sock_skb_set_dropcount(sk, skb);
1500
1501 __skb_queue_tail(list, skb);
1502 spin_unlock(&list->lock);
1503
1504 if (!sock_flag(sk, SOCK_DEAD))
1505 sk->sk_data_ready(sk);
1506
1507 busylock_release(busy);
1508 return 0;
1509
1510uncharge_drop:
1511 atomic_sub(skb->truesize, &sk->sk_rmem_alloc);
1512
1513drop:
1514 atomic_inc(&sk->sk_drops);
1515 busylock_release(busy);
1516 return err;
1517}
1518EXPORT_SYMBOL_GPL(__udp_enqueue_schedule_skb);
1519
1520void udp_destruct_sock(struct sock *sk)
1521{
1522 /* reclaim completely the forward allocated memory */
1523 struct udp_sock *up = udp_sk(sk);
1524 unsigned int total = 0;
1525 struct sk_buff *skb;
1526
1527 skb_queue_splice_tail_init(&sk->sk_receive_queue, &up->reader_queue);
1528 while ((skb = __skb_dequeue(&up->reader_queue)) != NULL) {
1529 total += skb->truesize;
1530 kfree_skb(skb);
1531 }
1532 udp_rmem_release(sk, total, 0, true);
1533
1534 inet_sock_destruct(sk);
1535}
1536EXPORT_SYMBOL_GPL(udp_destruct_sock);
1537
1538int udp_init_sock(struct sock *sk)
1539{
1540 skb_queue_head_init(&udp_sk(sk)->reader_queue);
1541 sk->sk_destruct = udp_destruct_sock;
1542 return 0;
1543}
1544EXPORT_SYMBOL_GPL(udp_init_sock);
1545
1546void skb_consume_udp(struct sock *sk, struct sk_buff *skb, int len)
1547{
1548 if (unlikely(READ_ONCE(sk->sk_peek_off) >= 0)) {
1549 bool slow = lock_sock_fast(sk);
1550
1551 sk_peek_offset_bwd(sk, len);
1552 unlock_sock_fast(sk, slow);
1553 }
1554
1555 if (!skb_unref(skb))
1556 return;
1557
1558 /* In the more common cases we cleared the head states previously,
1559 * see __udp_queue_rcv_skb().
1560 */
1561 if (unlikely(udp_skb_has_head_state(skb)))
1562 skb_release_head_state(skb);
1563 __consume_stateless_skb(skb);
1564}
1565EXPORT_SYMBOL_GPL(skb_consume_udp);
1566
1567static struct sk_buff *__first_packet_length(struct sock *sk,
1568 struct sk_buff_head *rcvq,
1569 int *total)
1570{
1571 struct sk_buff *skb;
1572
1573 while ((skb = skb_peek(rcvq)) != NULL) {
1574 if (udp_lib_checksum_complete(skb)) {
1575 __UDP_INC_STATS(sock_net(sk), UDP_MIB_CSUMERRORS,
1576 IS_UDPLITE(sk));
1577 __UDP_INC_STATS(sock_net(sk), UDP_MIB_INERRORS,
1578 IS_UDPLITE(sk));
1579 atomic_inc(&sk->sk_drops);
1580 __skb_unlink(skb, rcvq);
1581 *total += skb->truesize;
1582 kfree_skb(skb);
1583 } else {
1584 udp_skb_csum_unnecessary_set(skb);
1585 break;
1586 }
1587 }
1588 return skb;
1589}
1590
1591/**
1592 * first_packet_length - return length of first packet in receive queue
1593 * @sk: socket
1594 *
1595 * Drops all bad checksum frames, until a valid one is found.
1596 * Returns the length of found skb, or -1 if none is found.
1597 */
1598static int first_packet_length(struct sock *sk)
1599{
1600 struct sk_buff_head *rcvq = &udp_sk(sk)->reader_queue;
1601 struct sk_buff_head *sk_queue = &sk->sk_receive_queue;
1602 struct sk_buff *skb;
1603 int total = 0;
1604 int res;
1605
1606 spin_lock_bh(&rcvq->lock);
1607 skb = __first_packet_length(sk, rcvq, &total);
1608 if (!skb && !skb_queue_empty_lockless(sk_queue)) {
1609 spin_lock(&sk_queue->lock);
1610 skb_queue_splice_tail_init(sk_queue, rcvq);
1611 spin_unlock(&sk_queue->lock);
1612
1613 skb = __first_packet_length(sk, rcvq, &total);
1614 }
1615 res = skb ? skb->len : -1;
1616 if (total)
1617 udp_rmem_release(sk, total, 1, false);
1618 spin_unlock_bh(&rcvq->lock);
1619 return res;
1620}
1621
1622/*
1623 * IOCTL requests applicable to the UDP protocol
1624 */
1625
1626int udp_ioctl(struct sock *sk, int cmd, unsigned long arg)
1627{
1628 switch (cmd) {
1629 case SIOCOUTQ:
1630 {
1631 int amount = sk_wmem_alloc_get(sk);
1632
1633 return put_user(amount, (int __user *)arg);
1634 }
1635
1636 case SIOCINQ:
1637 {
1638 int amount = max_t(int, 0, first_packet_length(sk));
1639
1640 return put_user(amount, (int __user *)arg);
1641 }
1642
1643 default:
1644 return -ENOIOCTLCMD;
1645 }
1646
1647 return 0;
1648}
1649EXPORT_SYMBOL(udp_ioctl);
1650
1651struct sk_buff *__skb_recv_udp(struct sock *sk, unsigned int flags,
1652 int noblock, int *off, int *err)
1653{
1654 struct sk_buff_head *sk_queue = &sk->sk_receive_queue;
1655 struct sk_buff_head *queue;
1656 struct sk_buff *last;
1657 long timeo;
1658 int error;
1659
1660 queue = &udp_sk(sk)->reader_queue;
1661 flags |= noblock ? MSG_DONTWAIT : 0;
1662 timeo = sock_rcvtimeo(sk, flags & MSG_DONTWAIT);
1663 do {
1664 struct sk_buff *skb;
1665
1666 error = sock_error(sk);
1667 if (error)
1668 break;
1669
1670 error = -EAGAIN;
1671 do {
1672 spin_lock_bh(&queue->lock);
1673 skb = __skb_try_recv_from_queue(sk, queue, flags,
1674 udp_skb_destructor,
1675 off, err, &last);
1676 if (skb) {
1677 spin_unlock_bh(&queue->lock);
1678 return skb;
1679 }
1680
1681 if (skb_queue_empty_lockless(sk_queue)) {
1682 spin_unlock_bh(&queue->lock);
1683 goto busy_check;
1684 }
1685
1686 /* refill the reader queue and walk it again
1687 * keep both queues locked to avoid re-acquiring
1688 * the sk_receive_queue lock if fwd memory scheduling
1689 * is needed.
1690 */
1691 spin_lock(&sk_queue->lock);
1692 skb_queue_splice_tail_init(sk_queue, queue);
1693
1694 skb = __skb_try_recv_from_queue(sk, queue, flags,
1695 udp_skb_dtor_locked,
1696 off, err, &last);
1697 spin_unlock(&sk_queue->lock);
1698 spin_unlock_bh(&queue->lock);
1699 if (skb)
1700 return skb;
1701
1702busy_check:
1703 if (!sk_can_busy_loop(sk))
1704 break;
1705
1706 sk_busy_loop(sk, flags & MSG_DONTWAIT);
1707 } while (!skb_queue_empty_lockless(sk_queue));
1708
1709 /* sk_queue is empty, reader_queue may contain peeked packets */
1710 } while (timeo &&
1711 !__skb_wait_for_more_packets(sk, &error, &timeo,
1712 (struct sk_buff *)sk_queue));
1713
1714 *err = error;
1715 return NULL;
1716}
1717EXPORT_SYMBOL(__skb_recv_udp);
1718
1719/*
1720 * This should be easy, if there is something there we
1721 * return it, otherwise we block.
1722 */
1723
1724int udp_recvmsg(struct sock *sk, struct msghdr *msg, size_t len, int noblock,
1725 int flags, int *addr_len)
1726{
1727 struct inet_sock *inet = inet_sk(sk);
1728 DECLARE_SOCKADDR(struct sockaddr_in *, sin, msg->msg_name);
1729 struct sk_buff *skb;
1730 unsigned int ulen, copied;
1731 int off, err, peeking = flags & MSG_PEEK;
1732 int is_udplite = IS_UDPLITE(sk);
1733 bool checksum_valid = false;
1734
1735 if (flags & MSG_ERRQUEUE)
1736 return ip_recv_error(sk, msg, len, addr_len);
1737
1738try_again:
1739 off = sk_peek_offset(sk, flags);
1740 skb = __skb_recv_udp(sk, flags, noblock, &off, &err);
1741 if (!skb)
1742 return err;
1743
1744 ulen = udp_skb_len(skb);
1745 copied = len;
1746 if (copied > ulen - off)
1747 copied = ulen - off;
1748 else if (copied < ulen)
1749 msg->msg_flags |= MSG_TRUNC;
1750
1751 /*
1752 * If checksum is needed at all, try to do it while copying the
1753 * data. If the data is truncated, or if we only want a partial
1754 * coverage checksum (UDP-Lite), do it before the copy.
1755 */
1756
1757 if (copied < ulen || peeking ||
1758 (is_udplite && UDP_SKB_CB(skb)->partial_cov)) {
1759 checksum_valid = udp_skb_csum_unnecessary(skb) ||
1760 !__udp_lib_checksum_complete(skb);
1761 if (!checksum_valid)
1762 goto csum_copy_err;
1763 }
1764
1765 if (checksum_valid || udp_skb_csum_unnecessary(skb)) {
1766 if (udp_skb_is_linear(skb))
1767 err = copy_linear_skb(skb, copied, off, &msg->msg_iter);
1768 else
1769 err = skb_copy_datagram_msg(skb, off, msg, copied);
1770 } else {
1771 err = skb_copy_and_csum_datagram_msg(skb, off, msg);
1772
1773 if (err == -EINVAL)
1774 goto csum_copy_err;
1775 }
1776
1777 if (unlikely(err)) {
1778 if (!peeking) {
1779 atomic_inc(&sk->sk_drops);
1780 UDP_INC_STATS(sock_net(sk),
1781 UDP_MIB_INERRORS, is_udplite);
1782 }
1783 kfree_skb(skb);
1784 return err;
1785 }
1786
1787 if (!peeking)
1788 UDP_INC_STATS(sock_net(sk),
1789 UDP_MIB_INDATAGRAMS, is_udplite);
1790
1791 sock_recv_ts_and_drops(msg, sk, skb);
1792
1793 /* Copy the address. */
1794 if (sin) {
1795 sin->sin_family = AF_INET;
1796 sin->sin_port = udp_hdr(skb)->source;
1797 sin->sin_addr.s_addr = ip_hdr(skb)->saddr;
1798 memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
1799 *addr_len = sizeof(*sin);
1800
1801 if (cgroup_bpf_enabled)
1802 BPF_CGROUP_RUN_PROG_UDP4_RECVMSG_LOCK(sk,
1803 (struct sockaddr *)sin);
1804 }
1805
1806 if (udp_sk(sk)->gro_enabled)
1807 udp_cmsg_recv(msg, sk, skb);
1808
1809 if (inet->cmsg_flags)
1810 ip_cmsg_recv_offset(msg, sk, skb, sizeof(struct udphdr), off);
1811
1812 err = copied;
1813 if (flags & MSG_TRUNC)
1814 err = ulen;
1815
1816 skb_consume_udp(sk, skb, peeking ? -err : err);
1817 return err;
1818
1819csum_copy_err:
1820 if (!__sk_queue_drop_skb(sk, &udp_sk(sk)->reader_queue, skb, flags,
1821 udp_skb_destructor)) {
1822 UDP_INC_STATS(sock_net(sk), UDP_MIB_CSUMERRORS, is_udplite);
1823 UDP_INC_STATS(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1824 }
1825 kfree_skb(skb);
1826
1827 /* starting over for a new packet, but check if we need to yield */
1828 cond_resched();
1829 msg->msg_flags &= ~MSG_TRUNC;
1830 goto try_again;
1831}
1832
1833int udp_pre_connect(struct sock *sk, struct sockaddr *uaddr, int addr_len)
1834{
1835 /* This check is replicated from __ip4_datagram_connect() and
1836 * intended to prevent BPF program called below from accessing bytes
1837 * that are out of the bound specified by user in addr_len.
1838 */
1839 if (addr_len < sizeof(struct sockaddr_in))
1840 return -EINVAL;
1841
1842 return BPF_CGROUP_RUN_PROG_INET4_CONNECT_LOCK(sk, uaddr);
1843}
1844EXPORT_SYMBOL(udp_pre_connect);
1845
1846int __udp_disconnect(struct sock *sk, int flags)
1847{
1848 struct inet_sock *inet = inet_sk(sk);
1849 /*
1850 * 1003.1g - break association.
1851 */
1852
1853 sk->sk_state = TCP_CLOSE;
1854 inet->inet_daddr = 0;
1855 inet->inet_dport = 0;
1856 sock_rps_reset_rxhash(sk);
1857 sk->sk_bound_dev_if = 0;
1858 if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
1859 inet_reset_saddr(sk);
1860
1861 if (!(sk->sk_userlocks & SOCK_BINDPORT_LOCK)) {
1862 sk->sk_prot->unhash(sk);
1863 inet->inet_sport = 0;
1864 }
1865 sk_dst_reset(sk);
1866 return 0;
1867}
1868EXPORT_SYMBOL(__udp_disconnect);
1869
1870int udp_disconnect(struct sock *sk, int flags)
1871{
1872 lock_sock(sk);
1873 __udp_disconnect(sk, flags);
1874 release_sock(sk);
1875 return 0;
1876}
1877EXPORT_SYMBOL(udp_disconnect);
1878
1879void udp_lib_unhash(struct sock *sk)
1880{
1881 if (sk_hashed(sk)) {
1882 struct udp_table *udptable = sk->sk_prot->h.udp_table;
1883 struct udp_hslot *hslot, *hslot2;
1884
1885 hslot = udp_hashslot(udptable, sock_net(sk),
1886 udp_sk(sk)->udp_port_hash);
1887 hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
1888
1889 spin_lock_bh(&hslot->lock);
1890 if (rcu_access_pointer(sk->sk_reuseport_cb))
1891 reuseport_detach_sock(sk);
1892 if (sk_del_node_init_rcu(sk)) {
1893 hslot->count--;
1894 inet_sk(sk)->inet_num = 0;
1895 sock_prot_inuse_add(sock_net(sk), sk->sk_prot, -1);
1896
1897 spin_lock(&hslot2->lock);
1898 hlist_del_init_rcu(&udp_sk(sk)->udp_portaddr_node);
1899 hslot2->count--;
1900 spin_unlock(&hslot2->lock);
1901 }
1902 spin_unlock_bh(&hslot->lock);
1903 }
1904}
1905EXPORT_SYMBOL(udp_lib_unhash);
1906
1907/*
1908 * inet_rcv_saddr was changed, we must rehash secondary hash
1909 */
1910void udp_lib_rehash(struct sock *sk, u16 newhash)
1911{
1912 if (sk_hashed(sk)) {
1913 struct udp_table *udptable = sk->sk_prot->h.udp_table;
1914 struct udp_hslot *hslot, *hslot2, *nhslot2;
1915
1916 hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
1917 nhslot2 = udp_hashslot2(udptable, newhash);
1918 udp_sk(sk)->udp_portaddr_hash = newhash;
1919
1920 if (hslot2 != nhslot2 ||
1921 rcu_access_pointer(sk->sk_reuseport_cb)) {
1922 hslot = udp_hashslot(udptable, sock_net(sk),
1923 udp_sk(sk)->udp_port_hash);
1924 /* we must lock primary chain too */
1925 spin_lock_bh(&hslot->lock);
1926 if (rcu_access_pointer(sk->sk_reuseport_cb))
1927 reuseport_detach_sock(sk);
1928
1929 if (hslot2 != nhslot2) {
1930 spin_lock(&hslot2->lock);
1931 hlist_del_init_rcu(&udp_sk(sk)->udp_portaddr_node);
1932 hslot2->count--;
1933 spin_unlock(&hslot2->lock);
1934
1935 spin_lock(&nhslot2->lock);
1936 hlist_add_head_rcu(&udp_sk(sk)->udp_portaddr_node,
1937 &nhslot2->head);
1938 nhslot2->count++;
1939 spin_unlock(&nhslot2->lock);
1940 }
1941
1942 spin_unlock_bh(&hslot->lock);
1943 }
1944 }
1945}
1946EXPORT_SYMBOL(udp_lib_rehash);
1947
1948void udp_v4_rehash(struct sock *sk)
1949{
1950 u16 new_hash = ipv4_portaddr_hash(sock_net(sk),
1951 inet_sk(sk)->inet_rcv_saddr,
1952 inet_sk(sk)->inet_num);
1953 udp_lib_rehash(sk, new_hash);
1954}
1955
1956static int __udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
1957{
1958 int rc;
1959
1960 if (inet_sk(sk)->inet_daddr) {
1961 sock_rps_save_rxhash(sk, skb);
1962 sk_mark_napi_id(sk, skb);
1963 sk_incoming_cpu_update(sk);
1964 } else {
1965 sk_mark_napi_id_once(sk, skb);
1966 }
1967
1968 rc = __udp_enqueue_schedule_skb(sk, skb);
1969 if (rc < 0) {
1970 int is_udplite = IS_UDPLITE(sk);
1971
1972 /* Note that an ENOMEM error is charged twice */
1973 if (rc == -ENOMEM)
1974 UDP_INC_STATS(sock_net(sk), UDP_MIB_RCVBUFERRORS,
1975 is_udplite);
1976 UDP_INC_STATS(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1977 kfree_skb(skb);
1978 trace_udp_fail_queue_rcv_skb(rc, sk);
1979 return -1;
1980 }
1981
1982 return 0;
1983}
1984
1985/* returns:
1986 * -1: error
1987 * 0: success
1988 * >0: "udp encap" protocol resubmission
1989 *
1990 * Note that in the success and error cases, the skb is assumed to
1991 * have either been requeued or freed.
1992 */
1993static int udp_queue_rcv_one_skb(struct sock *sk, struct sk_buff *skb)
1994{
1995 struct udp_sock *up = udp_sk(sk);
1996 int is_udplite = IS_UDPLITE(sk);
1997
1998 /*
1999 * Charge it to the socket, dropping if the queue is full.
2000 */
2001 if (!xfrm4_policy_check(sk, XFRM_POLICY_IN, skb))
2002 goto drop;
2003 nf_reset_ct(skb);
2004
2005 if (static_branch_unlikely(&udp_encap_needed_key) && up->encap_type) {
2006 int (*encap_rcv)(struct sock *sk, struct sk_buff *skb);
2007
2008 /*
2009 * This is an encapsulation socket so pass the skb to
2010 * the socket's udp_encap_rcv() hook. Otherwise, just
2011 * fall through and pass this up the UDP socket.
2012 * up->encap_rcv() returns the following value:
2013 * =0 if skb was successfully passed to the encap
2014 * handler or was discarded by it.
2015 * >0 if skb should be passed on to UDP.
2016 * <0 if skb should be resubmitted as proto -N
2017 */
2018
2019 /* if we're overly short, let UDP handle it */
2020 encap_rcv = READ_ONCE(up->encap_rcv);
2021 if (encap_rcv) {
2022 int ret;
2023
2024 /* Verify checksum before giving to encap */
2025 if (udp_lib_checksum_complete(skb))
2026 goto csum_error;
2027
2028 ret = encap_rcv(sk, skb);
2029 if (ret <= 0) {
2030 __UDP_INC_STATS(sock_net(sk),
2031 UDP_MIB_INDATAGRAMS,
2032 is_udplite);
2033 return -ret;
2034 }
2035 }
2036
2037 /* FALLTHROUGH -- it's a UDP Packet */
2038 }
2039
2040 /*
2041 * UDP-Lite specific tests, ignored on UDP sockets
2042 */
2043 if ((is_udplite & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) {
2044
2045 /*
2046 * MIB statistics other than incrementing the error count are
2047 * disabled for the following two types of errors: these depend
2048 * on the application settings, not on the functioning of the
2049 * protocol stack as such.
2050 *
2051 * RFC 3828 here recommends (sec 3.3): "There should also be a
2052 * way ... to ... at least let the receiving application block
2053 * delivery of packets with coverage values less than a value
2054 * provided by the application."
2055 */
2056 if (up->pcrlen == 0) { /* full coverage was set */
2057 net_dbg_ratelimited("UDPLite: partial coverage %d while full coverage %d requested\n",
2058 UDP_SKB_CB(skb)->cscov, skb->len);
2059 goto drop;
2060 }
2061 /* The next case involves violating the min. coverage requested
2062 * by the receiver. This is subtle: if receiver wants x and x is
2063 * greater than the buffersize/MTU then receiver will complain
2064 * that it wants x while sender emits packets of smaller size y.
2065 * Therefore the above ...()->partial_cov statement is essential.
2066 */
2067 if (UDP_SKB_CB(skb)->cscov < up->pcrlen) {
2068 net_dbg_ratelimited("UDPLite: coverage %d too small, need min %d\n",
2069 UDP_SKB_CB(skb)->cscov, up->pcrlen);
2070 goto drop;
2071 }
2072 }
2073
2074 prefetch(&sk->sk_rmem_alloc);
2075 if (rcu_access_pointer(sk->sk_filter) &&
2076 udp_lib_checksum_complete(skb))
2077 goto csum_error;
2078
2079 if (sk_filter_trim_cap(sk, skb, sizeof(struct udphdr)))
2080 goto drop;
2081
2082 udp_csum_pull_header(skb);
2083
2084 ipv4_pktinfo_prepare(sk, skb);
2085 return __udp_queue_rcv_skb(sk, skb);
2086
2087csum_error:
2088 __UDP_INC_STATS(sock_net(sk), UDP_MIB_CSUMERRORS, is_udplite);
2089drop:
2090 __UDP_INC_STATS(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
2091 atomic_inc(&sk->sk_drops);
2092 kfree_skb(skb);
2093 return -1;
2094}
2095
2096static int udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
2097{
2098 struct sk_buff *next, *segs;
2099 int ret;
2100
2101 if (likely(!udp_unexpected_gso(sk, skb)))
2102 return udp_queue_rcv_one_skb(sk, skb);
2103
2104 BUILD_BUG_ON(sizeof(struct udp_skb_cb) > SKB_SGO_CB_OFFSET);
2105 __skb_push(skb, -skb_mac_offset(skb));
2106 segs = udp_rcv_segment(sk, skb, true);
2107 for (skb = segs; skb; skb = next) {
2108 next = skb->next;
2109 __skb_pull(skb, skb_transport_offset(skb));
2110 ret = udp_queue_rcv_one_skb(sk, skb);
2111 if (ret > 0)
2112 ip_protocol_deliver_rcu(dev_net(skb->dev), skb, -ret);
2113 }
2114 return 0;
2115}
2116
2117/* For TCP sockets, sk_rx_dst is protected by socket lock
2118 * For UDP, we use xchg() to guard against concurrent changes.
2119 */
2120bool udp_sk_rx_dst_set(struct sock *sk, struct dst_entry *dst)
2121{
2122 struct dst_entry *old;
2123
2124 if (dst_hold_safe(dst)) {
2125 old = xchg(&sk->sk_rx_dst, dst);
2126 dst_release(old);
2127 return old != dst;
2128 }
2129 return false;
2130}
2131EXPORT_SYMBOL(udp_sk_rx_dst_set);
2132
2133/*
2134 * Multicasts and broadcasts go to each listener.
2135 *
2136 * Note: called only from the BH handler context.
2137 */
2138static int __udp4_lib_mcast_deliver(struct net *net, struct sk_buff *skb,
2139 struct udphdr *uh,
2140 __be32 saddr, __be32 daddr,
2141 struct udp_table *udptable,
2142 int proto)
2143{
2144 struct sock *sk, *first = NULL;
2145 unsigned short hnum = ntohs(uh->dest);
2146 struct udp_hslot *hslot = udp_hashslot(udptable, net, hnum);
2147 unsigned int hash2 = 0, hash2_any = 0, use_hash2 = (hslot->count > 10);
2148 unsigned int offset = offsetof(typeof(*sk), sk_node);
2149 int dif = skb->dev->ifindex;
2150 int sdif = inet_sdif(skb);
2151 struct hlist_node *node;
2152 struct sk_buff *nskb;
2153
2154 if (use_hash2) {
2155 hash2_any = ipv4_portaddr_hash(net, htonl(INADDR_ANY), hnum) &
2156 udptable->mask;
2157 hash2 = ipv4_portaddr_hash(net, daddr, hnum) & udptable->mask;
2158start_lookup:
2159 hslot = &udptable->hash2[hash2];
2160 offset = offsetof(typeof(*sk), __sk_common.skc_portaddr_node);
2161 }
2162
2163 sk_for_each_entry_offset_rcu(sk, node, &hslot->head, offset) {
2164 if (!__udp_is_mcast_sock(net, sk, uh->dest, daddr,
2165 uh->source, saddr, dif, sdif, hnum))
2166 continue;
2167
2168 if (!first) {
2169 first = sk;
2170 continue;
2171 }
2172 nskb = skb_clone(skb, GFP_ATOMIC);
2173
2174 if (unlikely(!nskb)) {
2175 atomic_inc(&sk->sk_drops);
2176 __UDP_INC_STATS(net, UDP_MIB_RCVBUFERRORS,
2177 IS_UDPLITE(sk));
2178 __UDP_INC_STATS(net, UDP_MIB_INERRORS,
2179 IS_UDPLITE(sk));
2180 continue;
2181 }
2182 if (udp_queue_rcv_skb(sk, nskb) > 0)
2183 consume_skb(nskb);
2184 }
2185
2186 /* Also lookup *:port if we are using hash2 and haven't done so yet. */
2187 if (use_hash2 && hash2 != hash2_any) {
2188 hash2 = hash2_any;
2189 goto start_lookup;
2190 }
2191
2192 if (first) {
2193 if (udp_queue_rcv_skb(first, skb) > 0)
2194 consume_skb(skb);
2195 } else {
2196 kfree_skb(skb);
2197 __UDP_INC_STATS(net, UDP_MIB_IGNOREDMULTI,
2198 proto == IPPROTO_UDPLITE);
2199 }
2200 return 0;
2201}
2202
2203/* Initialize UDP checksum. If exited with zero value (success),
2204 * CHECKSUM_UNNECESSARY means, that no more checks are required.
2205 * Otherwise, csum completion requires checksumming packet body,
2206 * including udp header and folding it to skb->csum.
2207 */
2208static inline int udp4_csum_init(struct sk_buff *skb, struct udphdr *uh,
2209 int proto)
2210{
2211 int err;
2212
2213 UDP_SKB_CB(skb)->partial_cov = 0;
2214 UDP_SKB_CB(skb)->cscov = skb->len;
2215
2216 if (proto == IPPROTO_UDPLITE) {
2217 err = udplite_checksum_init(skb, uh);
2218 if (err)
2219 return err;
2220
2221 if (UDP_SKB_CB(skb)->partial_cov) {
2222 skb->csum = inet_compute_pseudo(skb, proto);
2223 return 0;
2224 }
2225 }
2226
2227 /* Note, we are only interested in != 0 or == 0, thus the
2228 * force to int.
2229 */
2230 err = (__force int)skb_checksum_init_zero_check(skb, proto, uh->check,
2231 inet_compute_pseudo);
2232 if (err)
2233 return err;
2234
2235 if (skb->ip_summed == CHECKSUM_COMPLETE && !skb->csum_valid) {
2236 /* If SW calculated the value, we know it's bad */
2237 if (skb->csum_complete_sw)
2238 return 1;
2239
2240 /* HW says the value is bad. Let's validate that.
2241 * skb->csum is no longer the full packet checksum,
2242 * so don't treat it as such.
2243 */
2244 skb_checksum_complete_unset(skb);
2245 }
2246
2247 return 0;
2248}
2249
2250/* wrapper for udp_queue_rcv_skb tacking care of csum conversion and
2251 * return code conversion for ip layer consumption
2252 */
2253static int udp_unicast_rcv_skb(struct sock *sk, struct sk_buff *skb,
2254 struct udphdr *uh)
2255{
2256 int ret;
2257
2258 if (inet_get_convert_csum(sk) && uh->check && !IS_UDPLITE(sk))
2259 skb_checksum_try_convert(skb, IPPROTO_UDP, inet_compute_pseudo);
2260
2261 ret = udp_queue_rcv_skb(sk, skb);
2262
2263 /* a return value > 0 means to resubmit the input, but
2264 * it wants the return to be -protocol, or 0
2265 */
2266 if (ret > 0)
2267 return -ret;
2268 return 0;
2269}
2270
2271/*
2272 * All we need to do is get the socket, and then do a checksum.
2273 */
2274
2275int __udp4_lib_rcv(struct sk_buff *skb, struct udp_table *udptable,
2276 int proto)
2277{
2278 struct sock *sk;
2279 struct udphdr *uh;
2280 unsigned short ulen;
2281 struct rtable *rt = skb_rtable(skb);
2282 __be32 saddr, daddr;
2283 struct net *net = dev_net(skb->dev);
2284
2285 /*
2286 * Validate the packet.
2287 */
2288 if (!pskb_may_pull(skb, sizeof(struct udphdr)))
2289 goto drop; /* No space for header. */
2290
2291 uh = udp_hdr(skb);
2292 ulen = ntohs(uh->len);
2293 saddr = ip_hdr(skb)->saddr;
2294 daddr = ip_hdr(skb)->daddr;
2295
2296 if (ulen > skb->len)
2297 goto short_packet;
2298
2299 if (proto == IPPROTO_UDP) {
2300 /* UDP validates ulen. */
2301 if (ulen < sizeof(*uh) || pskb_trim_rcsum(skb, ulen))
2302 goto short_packet;
2303 uh = udp_hdr(skb);
2304 }
2305
2306 if (udp4_csum_init(skb, uh, proto))
2307 goto csum_error;
2308
2309 sk = skb_steal_sock(skb);
2310 if (sk) {
2311 struct dst_entry *dst = skb_dst(skb);
2312 int ret;
2313
2314 if (unlikely(sk->sk_rx_dst != dst))
2315 udp_sk_rx_dst_set(sk, dst);
2316
2317 ret = udp_unicast_rcv_skb(sk, skb, uh);
2318 sock_put(sk);
2319 return ret;
2320 }
2321
2322 if (rt->rt_flags & (RTCF_BROADCAST|RTCF_MULTICAST))
2323 return __udp4_lib_mcast_deliver(net, skb, uh,
2324 saddr, daddr, udptable, proto);
2325
2326 sk = __udp4_lib_lookup_skb(skb, uh->source, uh->dest, udptable);
2327 if (sk)
2328 return udp_unicast_rcv_skb(sk, skb, uh);
2329
2330 if (!xfrm4_policy_check(NULL, XFRM_POLICY_IN, skb))
2331 goto drop;
2332 nf_reset_ct(skb);
2333
2334 /* No socket. Drop packet silently, if checksum is wrong */
2335 if (udp_lib_checksum_complete(skb))
2336 goto csum_error;
2337
2338 __UDP_INC_STATS(net, UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE);
2339 icmp_send(skb, ICMP_DEST_UNREACH, ICMP_PORT_UNREACH, 0);
2340
2341 /*
2342 * Hmm. We got an UDP packet to a port to which we
2343 * don't wanna listen. Ignore it.
2344 */
2345 kfree_skb(skb);
2346 return 0;
2347
2348short_packet:
2349 net_dbg_ratelimited("UDP%s: short packet: From %pI4:%u %d/%d to %pI4:%u\n",
2350 proto == IPPROTO_UDPLITE ? "Lite" : "",
2351 &saddr, ntohs(uh->source),
2352 ulen, skb->len,
2353 &daddr, ntohs(uh->dest));
2354 goto drop;
2355
2356csum_error:
2357 /*
2358 * RFC1122: OK. Discards the bad packet silently (as far as
2359 * the network is concerned, anyway) as per 4.1.3.4 (MUST).
2360 */
2361 net_dbg_ratelimited("UDP%s: bad checksum. From %pI4:%u to %pI4:%u ulen %d\n",
2362 proto == IPPROTO_UDPLITE ? "Lite" : "",
2363 &saddr, ntohs(uh->source), &daddr, ntohs(uh->dest),
2364 ulen);
2365 __UDP_INC_STATS(net, UDP_MIB_CSUMERRORS, proto == IPPROTO_UDPLITE);
2366drop:
2367 __UDP_INC_STATS(net, UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE);
2368 kfree_skb(skb);
2369 return 0;
2370}
2371
2372/* We can only early demux multicast if there is a single matching socket.
2373 * If more than one socket found returns NULL
2374 */
2375static struct sock *__udp4_lib_mcast_demux_lookup(struct net *net,
2376 __be16 loc_port, __be32 loc_addr,
2377 __be16 rmt_port, __be32 rmt_addr,
2378 int dif, int sdif)
2379{
2380 struct sock *sk, *result;
2381 unsigned short hnum = ntohs(loc_port);
2382 unsigned int slot = udp_hashfn(net, hnum, udp_table.mask);
2383 struct udp_hslot *hslot = &udp_table.hash[slot];
2384
2385 /* Do not bother scanning a too big list */
2386 if (hslot->count > 10)
2387 return NULL;
2388
2389 result = NULL;
2390 sk_for_each_rcu(sk, &hslot->head) {
2391 if (__udp_is_mcast_sock(net, sk, loc_port, loc_addr,
2392 rmt_port, rmt_addr, dif, sdif, hnum)) {
2393 if (result)
2394 return NULL;
2395 result = sk;
2396 }
2397 }
2398
2399 return result;
2400}
2401
2402/* For unicast we should only early demux connected sockets or we can
2403 * break forwarding setups. The chains here can be long so only check
2404 * if the first socket is an exact match and if not move on.
2405 */
2406static struct sock *__udp4_lib_demux_lookup(struct net *net,
2407 __be16 loc_port, __be32 loc_addr,
2408 __be16 rmt_port, __be32 rmt_addr,
2409 int dif, int sdif)
2410{
2411 unsigned short hnum = ntohs(loc_port);
2412 unsigned int hash2 = ipv4_portaddr_hash(net, loc_addr, hnum);
2413 unsigned int slot2 = hash2 & udp_table.mask;
2414 struct udp_hslot *hslot2 = &udp_table.hash2[slot2];
2415 INET_ADDR_COOKIE(acookie, rmt_addr, loc_addr);
2416 const __portpair ports = INET_COMBINED_PORTS(rmt_port, hnum);
2417 struct sock *sk;
2418
2419 udp_portaddr_for_each_entry_rcu(sk, &hslot2->head) {
2420 if (INET_MATCH(sk, net, acookie, rmt_addr,
2421 loc_addr, ports, dif, sdif))
2422 return sk;
2423 /* Only check first socket in chain */
2424 break;
2425 }
2426 return NULL;
2427}
2428
2429int udp_v4_early_demux(struct sk_buff *skb)
2430{
2431 struct net *net = dev_net(skb->dev);
2432 struct in_device *in_dev = NULL;
2433 const struct iphdr *iph;
2434 const struct udphdr *uh;
2435 struct sock *sk = NULL;
2436 struct dst_entry *dst;
2437 int dif = skb->dev->ifindex;
2438 int sdif = inet_sdif(skb);
2439 int ours;
2440
2441 /* validate the packet */
2442 if (!pskb_may_pull(skb, skb_transport_offset(skb) + sizeof(struct udphdr)))
2443 return 0;
2444
2445 iph = ip_hdr(skb);
2446 uh = udp_hdr(skb);
2447
2448 if (skb->pkt_type == PACKET_MULTICAST) {
2449 in_dev = __in_dev_get_rcu(skb->dev);
2450
2451 if (!in_dev)
2452 return 0;
2453
2454 ours = ip_check_mc_rcu(in_dev, iph->daddr, iph->saddr,
2455 iph->protocol);
2456 if (!ours)
2457 return 0;
2458
2459 sk = __udp4_lib_mcast_demux_lookup(net, uh->dest, iph->daddr,
2460 uh->source, iph->saddr,
2461 dif, sdif);
2462 } else if (skb->pkt_type == PACKET_HOST) {
2463 sk = __udp4_lib_demux_lookup(net, uh->dest, iph->daddr,
2464 uh->source, iph->saddr, dif, sdif);
2465 }
2466
2467 if (!sk || !refcount_inc_not_zero(&sk->sk_refcnt))
2468 return 0;
2469
2470 skb->sk = sk;
2471 skb->destructor = sock_efree;
2472 dst = READ_ONCE(sk->sk_rx_dst);
2473
2474 if (dst)
2475 dst = dst_check(dst, 0);
2476 if (dst) {
2477 u32 itag = 0;
2478
2479 /* set noref for now.
2480 * any place which wants to hold dst has to call
2481 * dst_hold_safe()
2482 */
2483 skb_dst_set_noref(skb, dst);
2484
2485 /* for unconnected multicast sockets we need to validate
2486 * the source on each packet
2487 */
2488 if (!inet_sk(sk)->inet_daddr && in_dev)
2489 return ip_mc_validate_source(skb, iph->daddr,
2490 iph->saddr, iph->tos,
2491 skb->dev, in_dev, &itag);
2492 }
2493 return 0;
2494}
2495
2496int udp_rcv(struct sk_buff *skb)
2497{
2498 return __udp4_lib_rcv(skb, &udp_table, IPPROTO_UDP);
2499}
2500
2501void udp_destroy_sock(struct sock *sk)
2502{
2503 struct udp_sock *up = udp_sk(sk);
2504 bool slow = lock_sock_fast(sk);
2505 udp_flush_pending_frames(sk);
2506 unlock_sock_fast(sk, slow);
2507 if (static_branch_unlikely(&udp_encap_needed_key)) {
2508 if (up->encap_type) {
2509 void (*encap_destroy)(struct sock *sk);
2510 encap_destroy = READ_ONCE(up->encap_destroy);
2511 if (encap_destroy)
2512 encap_destroy(sk);
2513 }
2514 if (up->encap_enabled)
2515 static_branch_dec(&udp_encap_needed_key);
2516 }
2517}
2518
2519/*
2520 * Socket option code for UDP
2521 */
2522int udp_lib_setsockopt(struct sock *sk, int level, int optname,
2523 char __user *optval, unsigned int optlen,
2524 int (*push_pending_frames)(struct sock *))
2525{
2526 struct udp_sock *up = udp_sk(sk);
2527 int val, valbool;
2528 int err = 0;
2529 int is_udplite = IS_UDPLITE(sk);
2530
2531 if (optlen < sizeof(int))
2532 return -EINVAL;
2533
2534 if (get_user(val, (int __user *)optval))
2535 return -EFAULT;
2536
2537 valbool = val ? 1 : 0;
2538
2539 switch (optname) {
2540 case UDP_CORK:
2541 if (val != 0) {
2542 up->corkflag = 1;
2543 } else {
2544 up->corkflag = 0;
2545 lock_sock(sk);
2546 push_pending_frames(sk);
2547 release_sock(sk);
2548 }
2549 break;
2550
2551 case UDP_ENCAP:
2552 switch (val) {
2553 case 0:
2554 case UDP_ENCAP_ESPINUDP:
2555 case UDP_ENCAP_ESPINUDP_NON_IKE:
2556 up->encap_rcv = xfrm4_udp_encap_rcv;
2557 /* FALLTHROUGH */
2558 case UDP_ENCAP_L2TPINUDP:
2559 up->encap_type = val;
2560 lock_sock(sk);
2561 udp_tunnel_encap_enable(sk->sk_socket);
2562 release_sock(sk);
2563 break;
2564 default:
2565 err = -ENOPROTOOPT;
2566 break;
2567 }
2568 break;
2569
2570 case UDP_NO_CHECK6_TX:
2571 up->no_check6_tx = valbool;
2572 break;
2573
2574 case UDP_NO_CHECK6_RX:
2575 up->no_check6_rx = valbool;
2576 break;
2577
2578 case UDP_SEGMENT:
2579 if (val < 0 || val > USHRT_MAX)
2580 return -EINVAL;
2581 up->gso_size = val;
2582 break;
2583
2584 case UDP_GRO:
2585 lock_sock(sk);
2586 if (valbool)
2587 udp_tunnel_encap_enable(sk->sk_socket);
2588 up->gro_enabled = valbool;
2589 release_sock(sk);
2590 break;
2591
2592 /*
2593 * UDP-Lite's partial checksum coverage (RFC 3828).
2594 */
2595 /* The sender sets actual checksum coverage length via this option.
2596 * The case coverage > packet length is handled by send module. */
2597 case UDPLITE_SEND_CSCOV:
2598 if (!is_udplite) /* Disable the option on UDP sockets */
2599 return -ENOPROTOOPT;
2600 if (val != 0 && val < 8) /* Illegal coverage: use default (8) */
2601 val = 8;
2602 else if (val > USHRT_MAX)
2603 val = USHRT_MAX;
2604 up->pcslen = val;
2605 up->pcflag |= UDPLITE_SEND_CC;
2606 break;
2607
2608 /* The receiver specifies a minimum checksum coverage value. To make
2609 * sense, this should be set to at least 8 (as done below). If zero is
2610 * used, this again means full checksum coverage. */
2611 case UDPLITE_RECV_CSCOV:
2612 if (!is_udplite) /* Disable the option on UDP sockets */
2613 return -ENOPROTOOPT;
2614 if (val != 0 && val < 8) /* Avoid silly minimal values. */
2615 val = 8;
2616 else if (val > USHRT_MAX)
2617 val = USHRT_MAX;
2618 up->pcrlen = val;
2619 up->pcflag |= UDPLITE_RECV_CC;
2620 break;
2621
2622 default:
2623 err = -ENOPROTOOPT;
2624 break;
2625 }
2626
2627 return err;
2628}
2629EXPORT_SYMBOL(udp_lib_setsockopt);
2630
2631int udp_setsockopt(struct sock *sk, int level, int optname,
2632 char __user *optval, unsigned int optlen)
2633{
2634 if (level == SOL_UDP || level == SOL_UDPLITE)
2635 return udp_lib_setsockopt(sk, level, optname, optval, optlen,
2636 udp_push_pending_frames);
2637 return ip_setsockopt(sk, level, optname, optval, optlen);
2638}
2639
2640#ifdef CONFIG_COMPAT
2641int compat_udp_setsockopt(struct sock *sk, int level, int optname,
2642 char __user *optval, unsigned int optlen)
2643{
2644 if (level == SOL_UDP || level == SOL_UDPLITE)
2645 return udp_lib_setsockopt(sk, level, optname, optval, optlen,
2646 udp_push_pending_frames);
2647 return compat_ip_setsockopt(sk, level, optname, optval, optlen);
2648}
2649#endif
2650
2651int udp_lib_getsockopt(struct sock *sk, int level, int optname,
2652 char __user *optval, int __user *optlen)
2653{
2654 struct udp_sock *up = udp_sk(sk);
2655 int val, len;
2656
2657 if (get_user(len, optlen))
2658 return -EFAULT;
2659
2660 len = min_t(unsigned int, len, sizeof(int));
2661
2662 if (len < 0)
2663 return -EINVAL;
2664
2665 switch (optname) {
2666 case UDP_CORK:
2667 val = up->corkflag;
2668 break;
2669
2670 case UDP_ENCAP:
2671 val = up->encap_type;
2672 break;
2673
2674 case UDP_NO_CHECK6_TX:
2675 val = up->no_check6_tx;
2676 break;
2677
2678 case UDP_NO_CHECK6_RX:
2679 val = up->no_check6_rx;
2680 break;
2681
2682 case UDP_SEGMENT:
2683 val = up->gso_size;
2684 break;
2685
2686 /* The following two cannot be changed on UDP sockets, the return is
2687 * always 0 (which corresponds to the full checksum coverage of UDP). */
2688 case UDPLITE_SEND_CSCOV:
2689 val = up->pcslen;
2690 break;
2691
2692 case UDPLITE_RECV_CSCOV:
2693 val = up->pcrlen;
2694 break;
2695
2696 default:
2697 return -ENOPROTOOPT;
2698 }
2699
2700 if (put_user(len, optlen))
2701 return -EFAULT;
2702 if (copy_to_user(optval, &val, len))
2703 return -EFAULT;
2704 return 0;
2705}
2706EXPORT_SYMBOL(udp_lib_getsockopt);
2707
2708int udp_getsockopt(struct sock *sk, int level, int optname,
2709 char __user *optval, int __user *optlen)
2710{
2711 if (level == SOL_UDP || level == SOL_UDPLITE)
2712 return udp_lib_getsockopt(sk, level, optname, optval, optlen);
2713 return ip_getsockopt(sk, level, optname, optval, optlen);
2714}
2715
2716#ifdef CONFIG_COMPAT
2717int compat_udp_getsockopt(struct sock *sk, int level, int optname,
2718 char __user *optval, int __user *optlen)
2719{
2720 if (level == SOL_UDP || level == SOL_UDPLITE)
2721 return udp_lib_getsockopt(sk, level, optname, optval, optlen);
2722 return compat_ip_getsockopt(sk, level, optname, optval, optlen);
2723}
2724#endif
2725/**
2726 * udp_poll - wait for a UDP event.
2727 * @file - file struct
2728 * @sock - socket
2729 * @wait - poll table
2730 *
2731 * This is same as datagram poll, except for the special case of
2732 * blocking sockets. If application is using a blocking fd
2733 * and a packet with checksum error is in the queue;
2734 * then it could get return from select indicating data available
2735 * but then block when reading it. Add special case code
2736 * to work around these arguably broken applications.
2737 */
2738__poll_t udp_poll(struct file *file, struct socket *sock, poll_table *wait)
2739{
2740 __poll_t mask = datagram_poll(file, sock, wait);
2741 struct sock *sk = sock->sk;
2742
2743 if (!skb_queue_empty_lockless(&udp_sk(sk)->reader_queue))
2744 mask |= EPOLLIN | EPOLLRDNORM;
2745
2746 /* Check for false positives due to checksum errors */
2747 if ((mask & EPOLLRDNORM) && !(file->f_flags & O_NONBLOCK) &&
2748 !(sk->sk_shutdown & RCV_SHUTDOWN) && first_packet_length(sk) == -1)
2749 mask &= ~(EPOLLIN | EPOLLRDNORM);
2750
2751 return mask;
2752
2753}
2754EXPORT_SYMBOL(udp_poll);
2755
2756int udp_abort(struct sock *sk, int err)
2757{
2758 lock_sock(sk);
2759
2760 sk->sk_err = err;
2761 sk->sk_error_report(sk);
2762 __udp_disconnect(sk, 0);
2763
2764 release_sock(sk);
2765
2766 return 0;
2767}
2768EXPORT_SYMBOL_GPL(udp_abort);
2769
2770struct proto udp_prot = {
2771 .name = "UDP",
2772 .owner = THIS_MODULE,
2773 .close = udp_lib_close,
2774 .pre_connect = udp_pre_connect,
2775 .connect = ip4_datagram_connect,
2776 .disconnect = udp_disconnect,
2777 .ioctl = udp_ioctl,
2778 .init = udp_init_sock,
2779 .destroy = udp_destroy_sock,
2780 .setsockopt = udp_setsockopt,
2781 .getsockopt = udp_getsockopt,
2782 .sendmsg = udp_sendmsg,
2783 .recvmsg = udp_recvmsg,
2784 .sendpage = udp_sendpage,
2785 .release_cb = ip4_datagram_release_cb,
2786 .hash = udp_lib_hash,
2787 .unhash = udp_lib_unhash,
2788 .rehash = udp_v4_rehash,
2789 .get_port = udp_v4_get_port,
2790 .memory_allocated = &udp_memory_allocated,
2791 .sysctl_mem = sysctl_udp_mem,
2792 .sysctl_wmem_offset = offsetof(struct net, ipv4.sysctl_udp_wmem_min),
2793 .sysctl_rmem_offset = offsetof(struct net, ipv4.sysctl_udp_rmem_min),
2794 .obj_size = sizeof(struct udp_sock),
2795 .h.udp_table = &udp_table,
2796#ifdef CONFIG_COMPAT
2797 .compat_setsockopt = compat_udp_setsockopt,
2798 .compat_getsockopt = compat_udp_getsockopt,
2799#endif
2800 .diag_destroy = udp_abort,
2801};
2802EXPORT_SYMBOL(udp_prot);
2803
2804/* ------------------------------------------------------------------------ */
2805#ifdef CONFIG_PROC_FS
2806
2807static struct sock *udp_get_first(struct seq_file *seq, int start)
2808{
2809 struct sock *sk;
2810 struct udp_seq_afinfo *afinfo = PDE_DATA(file_inode(seq->file));
2811 struct udp_iter_state *state = seq->private;
2812 struct net *net = seq_file_net(seq);
2813
2814 for (state->bucket = start; state->bucket <= afinfo->udp_table->mask;
2815 ++state->bucket) {
2816 struct udp_hslot *hslot = &afinfo->udp_table->hash[state->bucket];
2817
2818 if (hlist_empty(&hslot->head))
2819 continue;
2820
2821 spin_lock_bh(&hslot->lock);
2822 sk_for_each(sk, &hslot->head) {
2823 if (!net_eq(sock_net(sk), net))
2824 continue;
2825 if (sk->sk_family == afinfo->family)
2826 goto found;
2827 }
2828 spin_unlock_bh(&hslot->lock);
2829 }
2830 sk = NULL;
2831found:
2832 return sk;
2833}
2834
2835static struct sock *udp_get_next(struct seq_file *seq, struct sock *sk)
2836{
2837 struct udp_seq_afinfo *afinfo = PDE_DATA(file_inode(seq->file));
2838 struct udp_iter_state *state = seq->private;
2839 struct net *net = seq_file_net(seq);
2840
2841 do {
2842 sk = sk_next(sk);
2843 } while (sk && (!net_eq(sock_net(sk), net) || sk->sk_family != afinfo->family));
2844
2845 if (!sk) {
2846 if (state->bucket <= afinfo->udp_table->mask)
2847 spin_unlock_bh(&afinfo->udp_table->hash[state->bucket].lock);
2848 return udp_get_first(seq, state->bucket + 1);
2849 }
2850 return sk;
2851}
2852
2853static struct sock *udp_get_idx(struct seq_file *seq, loff_t pos)
2854{
2855 struct sock *sk = udp_get_first(seq, 0);
2856
2857 if (sk)
2858 while (pos && (sk = udp_get_next(seq, sk)) != NULL)
2859 --pos;
2860 return pos ? NULL : sk;
2861}
2862
2863void *udp_seq_start(struct seq_file *seq, loff_t *pos)
2864{
2865 struct udp_iter_state *state = seq->private;
2866 state->bucket = MAX_UDP_PORTS;
2867
2868 return *pos ? udp_get_idx(seq, *pos-1) : SEQ_START_TOKEN;
2869}
2870EXPORT_SYMBOL(udp_seq_start);
2871
2872void *udp_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2873{
2874 struct sock *sk;
2875
2876 if (v == SEQ_START_TOKEN)
2877 sk = udp_get_idx(seq, 0);
2878 else
2879 sk = udp_get_next(seq, v);
2880
2881 ++*pos;
2882 return sk;
2883}
2884EXPORT_SYMBOL(udp_seq_next);
2885
2886void udp_seq_stop(struct seq_file *seq, void *v)
2887{
2888 struct udp_seq_afinfo *afinfo = PDE_DATA(file_inode(seq->file));
2889 struct udp_iter_state *state = seq->private;
2890
2891 if (state->bucket <= afinfo->udp_table->mask)
2892 spin_unlock_bh(&afinfo->udp_table->hash[state->bucket].lock);
2893}
2894EXPORT_SYMBOL(udp_seq_stop);
2895
2896/* ------------------------------------------------------------------------ */
2897static void udp4_format_sock(struct sock *sp, struct seq_file *f,
2898 int bucket)
2899{
2900 struct inet_sock *inet = inet_sk(sp);
2901 __be32 dest = inet->inet_daddr;
2902 __be32 src = inet->inet_rcv_saddr;
2903 __u16 destp = ntohs(inet->inet_dport);
2904 __u16 srcp = ntohs(inet->inet_sport);
2905
2906 seq_printf(f, "%5d: %08X:%04X %08X:%04X"
2907 " %02X %08X:%08X %02X:%08lX %08X %5u %8d %lu %d %pK %u",
2908 bucket, src, srcp, dest, destp, sp->sk_state,
2909 sk_wmem_alloc_get(sp),
2910 udp_rqueue_get(sp),
2911 0, 0L, 0,
2912 from_kuid_munged(seq_user_ns(f), sock_i_uid(sp)),
2913 0, sock_i_ino(sp),
2914 refcount_read(&sp->sk_refcnt), sp,
2915 atomic_read(&sp->sk_drops));
2916}
2917
2918int udp4_seq_show(struct seq_file *seq, void *v)
2919{
2920 seq_setwidth(seq, 127);
2921 if (v == SEQ_START_TOKEN)
2922 seq_puts(seq, " sl local_address rem_address st tx_queue "
2923 "rx_queue tr tm->when retrnsmt uid timeout "
2924 "inode ref pointer drops");
2925 else {
2926 struct udp_iter_state *state = seq->private;
2927
2928 udp4_format_sock(v, seq, state->bucket);
2929 }
2930 seq_pad(seq, '\n');
2931 return 0;
2932}
2933
2934const struct seq_operations udp_seq_ops = {
2935 .start = udp_seq_start,
2936 .next = udp_seq_next,
2937 .stop = udp_seq_stop,
2938 .show = udp4_seq_show,
2939};
2940EXPORT_SYMBOL(udp_seq_ops);
2941
2942static struct udp_seq_afinfo udp4_seq_afinfo = {
2943 .family = AF_INET,
2944 .udp_table = &udp_table,
2945};
2946
2947static int __net_init udp4_proc_init_net(struct net *net)
2948{
2949 if (!proc_create_net_data("udp", 0444, net->proc_net, &udp_seq_ops,
2950 sizeof(struct udp_iter_state), &udp4_seq_afinfo))
2951 return -ENOMEM;
2952 return 0;
2953}
2954
2955static void __net_exit udp4_proc_exit_net(struct net *net)
2956{
2957 remove_proc_entry("udp", net->proc_net);
2958}
2959
2960static struct pernet_operations udp4_net_ops = {
2961 .init = udp4_proc_init_net,
2962 .exit = udp4_proc_exit_net,
2963};
2964
2965int __init udp4_proc_init(void)
2966{
2967 return register_pernet_subsys(&udp4_net_ops);
2968}
2969
2970void udp4_proc_exit(void)
2971{
2972 unregister_pernet_subsys(&udp4_net_ops);
2973}
2974#endif /* CONFIG_PROC_FS */
2975
2976static __initdata unsigned long uhash_entries;
2977static int __init set_uhash_entries(char *str)
2978{
2979 ssize_t ret;
2980
2981 if (!str)
2982 return 0;
2983
2984 ret = kstrtoul(str, 0, &uhash_entries);
2985 if (ret)
2986 return 0;
2987
2988 if (uhash_entries && uhash_entries < UDP_HTABLE_SIZE_MIN)
2989 uhash_entries = UDP_HTABLE_SIZE_MIN;
2990 return 1;
2991}
2992__setup("uhash_entries=", set_uhash_entries);
2993
2994void __init udp_table_init(struct udp_table *table, const char *name)
2995{
2996 unsigned int i;
2997
2998 table->hash = alloc_large_system_hash(name,
2999 2 * sizeof(struct udp_hslot),
3000 uhash_entries,
3001 21, /* one slot per 2 MB */
3002 0,
3003 &table->log,
3004 &table->mask,
3005 UDP_HTABLE_SIZE_MIN,
3006 64 * 1024);
3007
3008 table->hash2 = table->hash + (table->mask + 1);
3009 for (i = 0; i <= table->mask; i++) {
3010 INIT_HLIST_HEAD(&table->hash[i].head);
3011 table->hash[i].count = 0;
3012 spin_lock_init(&table->hash[i].lock);
3013 }
3014 for (i = 0; i <= table->mask; i++) {
3015 INIT_HLIST_HEAD(&table->hash2[i].head);
3016 table->hash2[i].count = 0;
3017 spin_lock_init(&table->hash2[i].lock);
3018 }
3019}
3020
3021u32 udp_flow_hashrnd(void)
3022{
3023 static u32 hashrnd __read_mostly;
3024
3025 net_get_random_once(&hashrnd, sizeof(hashrnd));
3026
3027 return hashrnd;
3028}
3029EXPORT_SYMBOL(udp_flow_hashrnd);
3030
3031static void __udp_sysctl_init(struct net *net)
3032{
3033 net->ipv4.sysctl_udp_rmem_min = SK_MEM_QUANTUM;
3034 net->ipv4.sysctl_udp_wmem_min = SK_MEM_QUANTUM;
3035
3036#ifdef CONFIG_NET_L3_MASTER_DEV
3037 net->ipv4.sysctl_udp_l3mdev_accept = 0;
3038#endif
3039}
3040
3041static int __net_init udp_sysctl_init(struct net *net)
3042{
3043 __udp_sysctl_init(net);
3044 return 0;
3045}
3046
3047static struct pernet_operations __net_initdata udp_sysctl_ops = {
3048 .init = udp_sysctl_init,
3049};
3050
3051void __init udp_init(void)
3052{
3053 unsigned long limit;
3054 unsigned int i;
3055
3056 udp_table_init(&udp_table, "UDP");
3057 limit = nr_free_buffer_pages() / 8;
3058 limit = max(limit, 128UL);
3059 sysctl_udp_mem[0] = limit / 4 * 3;
3060 sysctl_udp_mem[1] = limit;
3061 sysctl_udp_mem[2] = sysctl_udp_mem[0] * 2;
3062
3063 __udp_sysctl_init(&init_net);
3064
3065 /* 16 spinlocks per cpu */
3066 udp_busylocks_log = ilog2(nr_cpu_ids) + 4;
3067 udp_busylocks = kmalloc(sizeof(spinlock_t) << udp_busylocks_log,
3068 GFP_KERNEL);
3069 if (!udp_busylocks)
3070 panic("UDP: failed to alloc udp_busylocks\n");
3071 for (i = 0; i < (1U << udp_busylocks_log); i++)
3072 spin_lock_init(udp_busylocks + i);
3073
3074 if (register_pernet_subsys(&udp_sysctl_ops))
3075 panic("UDP: failed to init sysctl parameters.\n");
3076}
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#define pr_fmt(fmt) "UDP: " fmt
81
82#include <asm/uaccess.h>
83#include <asm/ioctls.h>
84#include <linux/bootmem.h>
85#include <linux/highmem.h>
86#include <linux/swap.h>
87#include <linux/types.h>
88#include <linux/fcntl.h>
89#include <linux/module.h>
90#include <linux/socket.h>
91#include <linux/sockios.h>
92#include <linux/igmp.h>
93#include <linux/in.h>
94#include <linux/errno.h>
95#include <linux/timer.h>
96#include <linux/mm.h>
97#include <linux/inet.h>
98#include <linux/netdevice.h>
99#include <linux/slab.h>
100#include <net/tcp_states.h>
101#include <linux/skbuff.h>
102#include <linux/proc_fs.h>
103#include <linux/seq_file.h>
104#include <net/net_namespace.h>
105#include <net/icmp.h>
106#include <net/route.h>
107#include <net/checksum.h>
108#include <net/xfrm.h>
109#include <trace/events/udp.h>
110#include <linux/static_key.h>
111#include "udp_impl.h"
112
113struct udp_table udp_table __read_mostly;
114EXPORT_SYMBOL(udp_table);
115
116long sysctl_udp_mem[3] __read_mostly;
117EXPORT_SYMBOL(sysctl_udp_mem);
118
119int sysctl_udp_rmem_min __read_mostly;
120EXPORT_SYMBOL(sysctl_udp_rmem_min);
121
122int sysctl_udp_wmem_min __read_mostly;
123EXPORT_SYMBOL(sysctl_udp_wmem_min);
124
125atomic_long_t udp_memory_allocated;
126EXPORT_SYMBOL(udp_memory_allocated);
127
128#define MAX_UDP_PORTS 65536
129#define PORTS_PER_CHAIN (MAX_UDP_PORTS / UDP_HTABLE_SIZE_MIN)
130
131static int udp_lib_lport_inuse(struct net *net, __u16 num,
132 const struct udp_hslot *hslot,
133 unsigned long *bitmap,
134 struct sock *sk,
135 int (*saddr_comp)(const struct sock *sk1,
136 const struct sock *sk2),
137 unsigned int log)
138{
139 struct sock *sk2;
140 struct hlist_nulls_node *node;
141
142 sk_nulls_for_each(sk2, node, &hslot->head)
143 if (net_eq(sock_net(sk2), net) &&
144 sk2 != sk &&
145 (bitmap || udp_sk(sk2)->udp_port_hash == num) &&
146 (!sk2->sk_reuse || !sk->sk_reuse) &&
147 (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if ||
148 sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
149 (*saddr_comp)(sk, sk2)) {
150 if (bitmap)
151 __set_bit(udp_sk(sk2)->udp_port_hash >> log,
152 bitmap);
153 else
154 return 1;
155 }
156 return 0;
157}
158
159/*
160 * Note: we still hold spinlock of primary hash chain, so no other writer
161 * can insert/delete a socket with local_port == num
162 */
163static int udp_lib_lport_inuse2(struct net *net, __u16 num,
164 struct udp_hslot *hslot2,
165 struct sock *sk,
166 int (*saddr_comp)(const struct sock *sk1,
167 const struct sock *sk2))
168{
169 struct sock *sk2;
170 struct hlist_nulls_node *node;
171 int res = 0;
172
173 spin_lock(&hslot2->lock);
174 udp_portaddr_for_each_entry(sk2, node, &hslot2->head)
175 if (net_eq(sock_net(sk2), net) &&
176 sk2 != sk &&
177 (udp_sk(sk2)->udp_port_hash == num) &&
178 (!sk2->sk_reuse || !sk->sk_reuse) &&
179 (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if ||
180 sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
181 (*saddr_comp)(sk, sk2)) {
182 res = 1;
183 break;
184 }
185 spin_unlock(&hslot2->lock);
186 return res;
187}
188
189/**
190 * udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
191 *
192 * @sk: socket struct in question
193 * @snum: port number to look up
194 * @saddr_comp: AF-dependent comparison of bound local IP addresses
195 * @hash2_nulladdr: AF-dependent hash value in secondary hash chains,
196 * with NULL address
197 */
198int udp_lib_get_port(struct sock *sk, unsigned short snum,
199 int (*saddr_comp)(const struct sock *sk1,
200 const struct sock *sk2),
201 unsigned int hash2_nulladdr)
202{
203 struct udp_hslot *hslot, *hslot2;
204 struct udp_table *udptable = sk->sk_prot->h.udp_table;
205 int error = 1;
206 struct net *net = sock_net(sk);
207
208 if (!snum) {
209 int low, high, remaining;
210 unsigned int rand;
211 unsigned short first, last;
212 DECLARE_BITMAP(bitmap, PORTS_PER_CHAIN);
213
214 inet_get_local_port_range(&low, &high);
215 remaining = (high - low) + 1;
216
217 rand = net_random();
218 first = (((u64)rand * remaining) >> 32) + low;
219 /*
220 * force rand to be an odd multiple of UDP_HTABLE_SIZE
221 */
222 rand = (rand | 1) * (udptable->mask + 1);
223 last = first + udptable->mask + 1;
224 do {
225 hslot = udp_hashslot(udptable, net, first);
226 bitmap_zero(bitmap, PORTS_PER_CHAIN);
227 spin_lock_bh(&hslot->lock);
228 udp_lib_lport_inuse(net, snum, hslot, bitmap, sk,
229 saddr_comp, udptable->log);
230
231 snum = first;
232 /*
233 * Iterate on all possible values of snum for this hash.
234 * Using steps of an odd multiple of UDP_HTABLE_SIZE
235 * give us randomization and full range coverage.
236 */
237 do {
238 if (low <= snum && snum <= high &&
239 !test_bit(snum >> udptable->log, bitmap) &&
240 !inet_is_reserved_local_port(snum))
241 goto found;
242 snum += rand;
243 } while (snum != first);
244 spin_unlock_bh(&hslot->lock);
245 } while (++first != last);
246 goto fail;
247 } else {
248 hslot = udp_hashslot(udptable, net, snum);
249 spin_lock_bh(&hslot->lock);
250 if (hslot->count > 10) {
251 int exist;
252 unsigned int slot2 = udp_sk(sk)->udp_portaddr_hash ^ snum;
253
254 slot2 &= udptable->mask;
255 hash2_nulladdr &= udptable->mask;
256
257 hslot2 = udp_hashslot2(udptable, slot2);
258 if (hslot->count < hslot2->count)
259 goto scan_primary_hash;
260
261 exist = udp_lib_lport_inuse2(net, snum, hslot2,
262 sk, saddr_comp);
263 if (!exist && (hash2_nulladdr != slot2)) {
264 hslot2 = udp_hashslot2(udptable, hash2_nulladdr);
265 exist = udp_lib_lport_inuse2(net, snum, hslot2,
266 sk, saddr_comp);
267 }
268 if (exist)
269 goto fail_unlock;
270 else
271 goto found;
272 }
273scan_primary_hash:
274 if (udp_lib_lport_inuse(net, snum, hslot, NULL, sk,
275 saddr_comp, 0))
276 goto fail_unlock;
277 }
278found:
279 inet_sk(sk)->inet_num = snum;
280 udp_sk(sk)->udp_port_hash = snum;
281 udp_sk(sk)->udp_portaddr_hash ^= snum;
282 if (sk_unhashed(sk)) {
283 sk_nulls_add_node_rcu(sk, &hslot->head);
284 hslot->count++;
285 sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1);
286
287 hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
288 spin_lock(&hslot2->lock);
289 hlist_nulls_add_head_rcu(&udp_sk(sk)->udp_portaddr_node,
290 &hslot2->head);
291 hslot2->count++;
292 spin_unlock(&hslot2->lock);
293 }
294 error = 0;
295fail_unlock:
296 spin_unlock_bh(&hslot->lock);
297fail:
298 return error;
299}
300EXPORT_SYMBOL(udp_lib_get_port);
301
302static int ipv4_rcv_saddr_equal(const struct sock *sk1, const struct sock *sk2)
303{
304 struct inet_sock *inet1 = inet_sk(sk1), *inet2 = inet_sk(sk2);
305
306 return (!ipv6_only_sock(sk2) &&
307 (!inet1->inet_rcv_saddr || !inet2->inet_rcv_saddr ||
308 inet1->inet_rcv_saddr == inet2->inet_rcv_saddr));
309}
310
311static unsigned int udp4_portaddr_hash(struct net *net, __be32 saddr,
312 unsigned int port)
313{
314 return jhash_1word((__force u32)saddr, net_hash_mix(net)) ^ port;
315}
316
317int udp_v4_get_port(struct sock *sk, unsigned short snum)
318{
319 unsigned int hash2_nulladdr =
320 udp4_portaddr_hash(sock_net(sk), htonl(INADDR_ANY), snum);
321 unsigned int hash2_partial =
322 udp4_portaddr_hash(sock_net(sk), inet_sk(sk)->inet_rcv_saddr, 0);
323
324 /* precompute partial secondary hash */
325 udp_sk(sk)->udp_portaddr_hash = hash2_partial;
326 return udp_lib_get_port(sk, snum, ipv4_rcv_saddr_equal, hash2_nulladdr);
327}
328
329static inline int compute_score(struct sock *sk, struct net *net, __be32 saddr,
330 unsigned short hnum,
331 __be16 sport, __be32 daddr, __be16 dport, int dif)
332{
333 int score = -1;
334
335 if (net_eq(sock_net(sk), net) && udp_sk(sk)->udp_port_hash == hnum &&
336 !ipv6_only_sock(sk)) {
337 struct inet_sock *inet = inet_sk(sk);
338
339 score = (sk->sk_family == PF_INET ? 1 : 0);
340 if (inet->inet_rcv_saddr) {
341 if (inet->inet_rcv_saddr != daddr)
342 return -1;
343 score += 2;
344 }
345 if (inet->inet_daddr) {
346 if (inet->inet_daddr != saddr)
347 return -1;
348 score += 2;
349 }
350 if (inet->inet_dport) {
351 if (inet->inet_dport != sport)
352 return -1;
353 score += 2;
354 }
355 if (sk->sk_bound_dev_if) {
356 if (sk->sk_bound_dev_if != dif)
357 return -1;
358 score += 2;
359 }
360 }
361 return score;
362}
363
364/*
365 * In this second variant, we check (daddr, dport) matches (inet_rcv_sadd, inet_num)
366 */
367#define SCORE2_MAX (1 + 2 + 2 + 2)
368static inline int compute_score2(struct sock *sk, struct net *net,
369 __be32 saddr, __be16 sport,
370 __be32 daddr, unsigned int hnum, int dif)
371{
372 int score = -1;
373
374 if (net_eq(sock_net(sk), net) && !ipv6_only_sock(sk)) {
375 struct inet_sock *inet = inet_sk(sk);
376
377 if (inet->inet_rcv_saddr != daddr)
378 return -1;
379 if (inet->inet_num != hnum)
380 return -1;
381
382 score = (sk->sk_family == PF_INET ? 1 : 0);
383 if (inet->inet_daddr) {
384 if (inet->inet_daddr != saddr)
385 return -1;
386 score += 2;
387 }
388 if (inet->inet_dport) {
389 if (inet->inet_dport != sport)
390 return -1;
391 score += 2;
392 }
393 if (sk->sk_bound_dev_if) {
394 if (sk->sk_bound_dev_if != dif)
395 return -1;
396 score += 2;
397 }
398 }
399 return score;
400}
401
402
403/* called with read_rcu_lock() */
404static struct sock *udp4_lib_lookup2(struct net *net,
405 __be32 saddr, __be16 sport,
406 __be32 daddr, unsigned int hnum, int dif,
407 struct udp_hslot *hslot2, unsigned int slot2)
408{
409 struct sock *sk, *result;
410 struct hlist_nulls_node *node;
411 int score, badness;
412
413begin:
414 result = NULL;
415 badness = -1;
416 udp_portaddr_for_each_entry_rcu(sk, node, &hslot2->head) {
417 score = compute_score2(sk, net, saddr, sport,
418 daddr, hnum, dif);
419 if (score > badness) {
420 result = sk;
421 badness = score;
422 if (score == SCORE2_MAX)
423 goto exact_match;
424 }
425 }
426 /*
427 * if the nulls value we got at the end of this lookup is
428 * not the expected one, we must restart lookup.
429 * We probably met an item that was moved to another chain.
430 */
431 if (get_nulls_value(node) != slot2)
432 goto begin;
433
434 if (result) {
435exact_match:
436 if (unlikely(!atomic_inc_not_zero_hint(&result->sk_refcnt, 2)))
437 result = NULL;
438 else if (unlikely(compute_score2(result, net, saddr, sport,
439 daddr, hnum, dif) < badness)) {
440 sock_put(result);
441 goto begin;
442 }
443 }
444 return result;
445}
446
447/* UDP is nearly always wildcards out the wazoo, it makes no sense to try
448 * harder than this. -DaveM
449 */
450struct sock *__udp4_lib_lookup(struct net *net, __be32 saddr,
451 __be16 sport, __be32 daddr, __be16 dport,
452 int dif, struct udp_table *udptable)
453{
454 struct sock *sk, *result;
455 struct hlist_nulls_node *node;
456 unsigned short hnum = ntohs(dport);
457 unsigned int hash2, slot2, slot = udp_hashfn(net, hnum, udptable->mask);
458 struct udp_hslot *hslot2, *hslot = &udptable->hash[slot];
459 int score, badness;
460
461 rcu_read_lock();
462 if (hslot->count > 10) {
463 hash2 = udp4_portaddr_hash(net, daddr, hnum);
464 slot2 = hash2 & udptable->mask;
465 hslot2 = &udptable->hash2[slot2];
466 if (hslot->count < hslot2->count)
467 goto begin;
468
469 result = udp4_lib_lookup2(net, saddr, sport,
470 daddr, hnum, dif,
471 hslot2, slot2);
472 if (!result) {
473 hash2 = udp4_portaddr_hash(net, htonl(INADDR_ANY), hnum);
474 slot2 = hash2 & udptable->mask;
475 hslot2 = &udptable->hash2[slot2];
476 if (hslot->count < hslot2->count)
477 goto begin;
478
479 result = udp4_lib_lookup2(net, saddr, sport,
480 htonl(INADDR_ANY), hnum, dif,
481 hslot2, slot2);
482 }
483 rcu_read_unlock();
484 return result;
485 }
486begin:
487 result = NULL;
488 badness = -1;
489 sk_nulls_for_each_rcu(sk, node, &hslot->head) {
490 score = compute_score(sk, net, saddr, hnum, sport,
491 daddr, dport, dif);
492 if (score > badness) {
493 result = sk;
494 badness = score;
495 }
496 }
497 /*
498 * if the nulls value we got at the end of this lookup is
499 * not the expected one, we must restart lookup.
500 * We probably met an item that was moved to another chain.
501 */
502 if (get_nulls_value(node) != slot)
503 goto begin;
504
505 if (result) {
506 if (unlikely(!atomic_inc_not_zero_hint(&result->sk_refcnt, 2)))
507 result = NULL;
508 else if (unlikely(compute_score(result, net, saddr, hnum, sport,
509 daddr, dport, dif) < badness)) {
510 sock_put(result);
511 goto begin;
512 }
513 }
514 rcu_read_unlock();
515 return result;
516}
517EXPORT_SYMBOL_GPL(__udp4_lib_lookup);
518
519static inline struct sock *__udp4_lib_lookup_skb(struct sk_buff *skb,
520 __be16 sport, __be16 dport,
521 struct udp_table *udptable)
522{
523 struct sock *sk;
524 const struct iphdr *iph = ip_hdr(skb);
525
526 if (unlikely(sk = skb_steal_sock(skb)))
527 return sk;
528 else
529 return __udp4_lib_lookup(dev_net(skb_dst(skb)->dev), iph->saddr, sport,
530 iph->daddr, dport, inet_iif(skb),
531 udptable);
532}
533
534struct sock *udp4_lib_lookup(struct net *net, __be32 saddr, __be16 sport,
535 __be32 daddr, __be16 dport, int dif)
536{
537 return __udp4_lib_lookup(net, saddr, sport, daddr, dport, dif, &udp_table);
538}
539EXPORT_SYMBOL_GPL(udp4_lib_lookup);
540
541static inline struct sock *udp_v4_mcast_next(struct net *net, struct sock *sk,
542 __be16 loc_port, __be32 loc_addr,
543 __be16 rmt_port, __be32 rmt_addr,
544 int dif)
545{
546 struct hlist_nulls_node *node;
547 struct sock *s = sk;
548 unsigned short hnum = ntohs(loc_port);
549
550 sk_nulls_for_each_from(s, node) {
551 struct inet_sock *inet = inet_sk(s);
552
553 if (!net_eq(sock_net(s), net) ||
554 udp_sk(s)->udp_port_hash != hnum ||
555 (inet->inet_daddr && inet->inet_daddr != rmt_addr) ||
556 (inet->inet_dport != rmt_port && inet->inet_dport) ||
557 (inet->inet_rcv_saddr &&
558 inet->inet_rcv_saddr != loc_addr) ||
559 ipv6_only_sock(s) ||
560 (s->sk_bound_dev_if && s->sk_bound_dev_if != dif))
561 continue;
562 if (!ip_mc_sf_allow(s, loc_addr, rmt_addr, dif))
563 continue;
564 goto found;
565 }
566 s = NULL;
567found:
568 return s;
569}
570
571/*
572 * This routine is called by the ICMP module when it gets some
573 * sort of error condition. If err < 0 then the socket should
574 * be closed and the error returned to the user. If err > 0
575 * it's just the icmp type << 8 | icmp code.
576 * Header points to the ip header of the error packet. We move
577 * on past this. Then (as it used to claim before adjustment)
578 * header points to the first 8 bytes of the udp header. We need
579 * to find the appropriate port.
580 */
581
582void __udp4_lib_err(struct sk_buff *skb, u32 info, struct udp_table *udptable)
583{
584 struct inet_sock *inet;
585 const struct iphdr *iph = (const struct iphdr *)skb->data;
586 struct udphdr *uh = (struct udphdr *)(skb->data+(iph->ihl<<2));
587 const int type = icmp_hdr(skb)->type;
588 const int code = icmp_hdr(skb)->code;
589 struct sock *sk;
590 int harderr;
591 int err;
592 struct net *net = dev_net(skb->dev);
593
594 sk = __udp4_lib_lookup(net, iph->daddr, uh->dest,
595 iph->saddr, uh->source, skb->dev->ifindex, udptable);
596 if (sk == NULL) {
597 ICMP_INC_STATS_BH(net, ICMP_MIB_INERRORS);
598 return; /* No socket for error */
599 }
600
601 err = 0;
602 harderr = 0;
603 inet = inet_sk(sk);
604
605 switch (type) {
606 default:
607 case ICMP_TIME_EXCEEDED:
608 err = EHOSTUNREACH;
609 break;
610 case ICMP_SOURCE_QUENCH:
611 goto out;
612 case ICMP_PARAMETERPROB:
613 err = EPROTO;
614 harderr = 1;
615 break;
616 case ICMP_DEST_UNREACH:
617 if (code == ICMP_FRAG_NEEDED) { /* Path MTU discovery */
618 if (inet->pmtudisc != IP_PMTUDISC_DONT) {
619 err = EMSGSIZE;
620 harderr = 1;
621 break;
622 }
623 goto out;
624 }
625 err = EHOSTUNREACH;
626 if (code <= NR_ICMP_UNREACH) {
627 harderr = icmp_err_convert[code].fatal;
628 err = icmp_err_convert[code].errno;
629 }
630 break;
631 }
632
633 /*
634 * RFC1122: OK. Passes ICMP errors back to application, as per
635 * 4.1.3.3.
636 */
637 if (!inet->recverr) {
638 if (!harderr || sk->sk_state != TCP_ESTABLISHED)
639 goto out;
640 } else
641 ip_icmp_error(sk, skb, err, uh->dest, info, (u8 *)(uh+1));
642
643 sk->sk_err = err;
644 sk->sk_error_report(sk);
645out:
646 sock_put(sk);
647}
648
649void udp_err(struct sk_buff *skb, u32 info)
650{
651 __udp4_lib_err(skb, info, &udp_table);
652}
653
654/*
655 * Throw away all pending data and cancel the corking. Socket is locked.
656 */
657void udp_flush_pending_frames(struct sock *sk)
658{
659 struct udp_sock *up = udp_sk(sk);
660
661 if (up->pending) {
662 up->len = 0;
663 up->pending = 0;
664 ip_flush_pending_frames(sk);
665 }
666}
667EXPORT_SYMBOL(udp_flush_pending_frames);
668
669/**
670 * udp4_hwcsum - handle outgoing HW checksumming
671 * @skb: sk_buff containing the filled-in UDP header
672 * (checksum field must be zeroed out)
673 * @src: source IP address
674 * @dst: destination IP address
675 */
676static void udp4_hwcsum(struct sk_buff *skb, __be32 src, __be32 dst)
677{
678 struct udphdr *uh = udp_hdr(skb);
679 struct sk_buff *frags = skb_shinfo(skb)->frag_list;
680 int offset = skb_transport_offset(skb);
681 int len = skb->len - offset;
682 int hlen = len;
683 __wsum csum = 0;
684
685 if (!frags) {
686 /*
687 * Only one fragment on the socket.
688 */
689 skb->csum_start = skb_transport_header(skb) - skb->head;
690 skb->csum_offset = offsetof(struct udphdr, check);
691 uh->check = ~csum_tcpudp_magic(src, dst, len,
692 IPPROTO_UDP, 0);
693 } else {
694 /*
695 * HW-checksum won't work as there are two or more
696 * fragments on the socket so that all csums of sk_buffs
697 * should be together
698 */
699 do {
700 csum = csum_add(csum, frags->csum);
701 hlen -= frags->len;
702 } while ((frags = frags->next));
703
704 csum = skb_checksum(skb, offset, hlen, csum);
705 skb->ip_summed = CHECKSUM_NONE;
706
707 uh->check = csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, csum);
708 if (uh->check == 0)
709 uh->check = CSUM_MANGLED_0;
710 }
711}
712
713static int udp_send_skb(struct sk_buff *skb, struct flowi4 *fl4)
714{
715 struct sock *sk = skb->sk;
716 struct inet_sock *inet = inet_sk(sk);
717 struct udphdr *uh;
718 int err = 0;
719 int is_udplite = IS_UDPLITE(sk);
720 int offset = skb_transport_offset(skb);
721 int len = skb->len - offset;
722 __wsum csum = 0;
723
724 /*
725 * Create a UDP header
726 */
727 uh = udp_hdr(skb);
728 uh->source = inet->inet_sport;
729 uh->dest = fl4->fl4_dport;
730 uh->len = htons(len);
731 uh->check = 0;
732
733 if (is_udplite) /* UDP-Lite */
734 csum = udplite_csum(skb);
735
736 else if (sk->sk_no_check == UDP_CSUM_NOXMIT) { /* UDP csum disabled */
737
738 skb->ip_summed = CHECKSUM_NONE;
739 goto send;
740
741 } else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */
742
743 udp4_hwcsum(skb, fl4->saddr, fl4->daddr);
744 goto send;
745
746 } else
747 csum = udp_csum(skb);
748
749 /* add protocol-dependent pseudo-header */
750 uh->check = csum_tcpudp_magic(fl4->saddr, fl4->daddr, len,
751 sk->sk_protocol, csum);
752 if (uh->check == 0)
753 uh->check = CSUM_MANGLED_0;
754
755send:
756 err = ip_send_skb(skb);
757 if (err) {
758 if (err == -ENOBUFS && !inet->recverr) {
759 UDP_INC_STATS_USER(sock_net(sk),
760 UDP_MIB_SNDBUFERRORS, is_udplite);
761 err = 0;
762 }
763 } else
764 UDP_INC_STATS_USER(sock_net(sk),
765 UDP_MIB_OUTDATAGRAMS, is_udplite);
766 return err;
767}
768
769/*
770 * Push out all pending data as one UDP datagram. Socket is locked.
771 */
772static int udp_push_pending_frames(struct sock *sk)
773{
774 struct udp_sock *up = udp_sk(sk);
775 struct inet_sock *inet = inet_sk(sk);
776 struct flowi4 *fl4 = &inet->cork.fl.u.ip4;
777 struct sk_buff *skb;
778 int err = 0;
779
780 skb = ip_finish_skb(sk, fl4);
781 if (!skb)
782 goto out;
783
784 err = udp_send_skb(skb, fl4);
785
786out:
787 up->len = 0;
788 up->pending = 0;
789 return err;
790}
791
792int udp_sendmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
793 size_t len)
794{
795 struct inet_sock *inet = inet_sk(sk);
796 struct udp_sock *up = udp_sk(sk);
797 struct flowi4 fl4_stack;
798 struct flowi4 *fl4;
799 int ulen = len;
800 struct ipcm_cookie ipc;
801 struct rtable *rt = NULL;
802 int free = 0;
803 int connected = 0;
804 __be32 daddr, faddr, saddr;
805 __be16 dport;
806 u8 tos;
807 int err, is_udplite = IS_UDPLITE(sk);
808 int corkreq = up->corkflag || msg->msg_flags&MSG_MORE;
809 int (*getfrag)(void *, char *, int, int, int, struct sk_buff *);
810 struct sk_buff *skb;
811 struct ip_options_data opt_copy;
812
813 if (len > 0xFFFF)
814 return -EMSGSIZE;
815
816 /*
817 * Check the flags.
818 */
819
820 if (msg->msg_flags & MSG_OOB) /* Mirror BSD error message compatibility */
821 return -EOPNOTSUPP;
822
823 ipc.opt = NULL;
824 ipc.tx_flags = 0;
825
826 getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag;
827
828 fl4 = &inet->cork.fl.u.ip4;
829 if (up->pending) {
830 /*
831 * There are pending frames.
832 * The socket lock must be held while it's corked.
833 */
834 lock_sock(sk);
835 if (likely(up->pending)) {
836 if (unlikely(up->pending != AF_INET)) {
837 release_sock(sk);
838 return -EINVAL;
839 }
840 goto do_append_data;
841 }
842 release_sock(sk);
843 }
844 ulen += sizeof(struct udphdr);
845
846 /*
847 * Get and verify the address.
848 */
849 if (msg->msg_name) {
850 struct sockaddr_in *usin = (struct sockaddr_in *)msg->msg_name;
851 if (msg->msg_namelen < sizeof(*usin))
852 return -EINVAL;
853 if (usin->sin_family != AF_INET) {
854 if (usin->sin_family != AF_UNSPEC)
855 return -EAFNOSUPPORT;
856 }
857
858 daddr = usin->sin_addr.s_addr;
859 dport = usin->sin_port;
860 if (dport == 0)
861 return -EINVAL;
862 } else {
863 if (sk->sk_state != TCP_ESTABLISHED)
864 return -EDESTADDRREQ;
865 daddr = inet->inet_daddr;
866 dport = inet->inet_dport;
867 /* Open fast path for connected socket.
868 Route will not be used, if at least one option is set.
869 */
870 connected = 1;
871 }
872 ipc.addr = inet->inet_saddr;
873
874 ipc.oif = sk->sk_bound_dev_if;
875 err = sock_tx_timestamp(sk, &ipc.tx_flags);
876 if (err)
877 return err;
878 if (msg->msg_controllen) {
879 err = ip_cmsg_send(sock_net(sk), msg, &ipc);
880 if (err)
881 return err;
882 if (ipc.opt)
883 free = 1;
884 connected = 0;
885 }
886 if (!ipc.opt) {
887 struct ip_options_rcu *inet_opt;
888
889 rcu_read_lock();
890 inet_opt = rcu_dereference(inet->inet_opt);
891 if (inet_opt) {
892 memcpy(&opt_copy, inet_opt,
893 sizeof(*inet_opt) + inet_opt->opt.optlen);
894 ipc.opt = &opt_copy.opt;
895 }
896 rcu_read_unlock();
897 }
898
899 saddr = ipc.addr;
900 ipc.addr = faddr = daddr;
901
902 if (ipc.opt && ipc.opt->opt.srr) {
903 if (!daddr)
904 return -EINVAL;
905 faddr = ipc.opt->opt.faddr;
906 connected = 0;
907 }
908 tos = RT_TOS(inet->tos);
909 if (sock_flag(sk, SOCK_LOCALROUTE) ||
910 (msg->msg_flags & MSG_DONTROUTE) ||
911 (ipc.opt && ipc.opt->opt.is_strictroute)) {
912 tos |= RTO_ONLINK;
913 connected = 0;
914 }
915
916 if (ipv4_is_multicast(daddr)) {
917 if (!ipc.oif)
918 ipc.oif = inet->mc_index;
919 if (!saddr)
920 saddr = inet->mc_addr;
921 connected = 0;
922 } else if (!ipc.oif)
923 ipc.oif = inet->uc_index;
924
925 if (connected)
926 rt = (struct rtable *)sk_dst_check(sk, 0);
927
928 if (rt == NULL) {
929 struct net *net = sock_net(sk);
930
931 fl4 = &fl4_stack;
932 flowi4_init_output(fl4, ipc.oif, sk->sk_mark, tos,
933 RT_SCOPE_UNIVERSE, sk->sk_protocol,
934 inet_sk_flowi_flags(sk)|FLOWI_FLAG_CAN_SLEEP,
935 faddr, saddr, dport, inet->inet_sport);
936
937 security_sk_classify_flow(sk, flowi4_to_flowi(fl4));
938 rt = ip_route_output_flow(net, fl4, sk);
939 if (IS_ERR(rt)) {
940 err = PTR_ERR(rt);
941 rt = NULL;
942 if (err == -ENETUNREACH)
943 IP_INC_STATS_BH(net, IPSTATS_MIB_OUTNOROUTES);
944 goto out;
945 }
946
947 err = -EACCES;
948 if ((rt->rt_flags & RTCF_BROADCAST) &&
949 !sock_flag(sk, SOCK_BROADCAST))
950 goto out;
951 if (connected)
952 sk_dst_set(sk, dst_clone(&rt->dst));
953 }
954
955 if (msg->msg_flags&MSG_CONFIRM)
956 goto do_confirm;
957back_from_confirm:
958
959 saddr = fl4->saddr;
960 if (!ipc.addr)
961 daddr = ipc.addr = fl4->daddr;
962
963 /* Lockless fast path for the non-corking case. */
964 if (!corkreq) {
965 skb = ip_make_skb(sk, fl4, getfrag, msg->msg_iov, ulen,
966 sizeof(struct udphdr), &ipc, &rt,
967 msg->msg_flags);
968 err = PTR_ERR(skb);
969 if (skb && !IS_ERR(skb))
970 err = udp_send_skb(skb, fl4);
971 goto out;
972 }
973
974 lock_sock(sk);
975 if (unlikely(up->pending)) {
976 /* The socket is already corked while preparing it. */
977 /* ... which is an evident application bug. --ANK */
978 release_sock(sk);
979
980 LIMIT_NETDEBUG(KERN_DEBUG pr_fmt("cork app bug 2\n"));
981 err = -EINVAL;
982 goto out;
983 }
984 /*
985 * Now cork the socket to pend data.
986 */
987 fl4 = &inet->cork.fl.u.ip4;
988 fl4->daddr = daddr;
989 fl4->saddr = saddr;
990 fl4->fl4_dport = dport;
991 fl4->fl4_sport = inet->inet_sport;
992 up->pending = AF_INET;
993
994do_append_data:
995 up->len += ulen;
996 err = ip_append_data(sk, fl4, getfrag, msg->msg_iov, ulen,
997 sizeof(struct udphdr), &ipc, &rt,
998 corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags);
999 if (err)
1000 udp_flush_pending_frames(sk);
1001 else if (!corkreq)
1002 err = udp_push_pending_frames(sk);
1003 else if (unlikely(skb_queue_empty(&sk->sk_write_queue)))
1004 up->pending = 0;
1005 release_sock(sk);
1006
1007out:
1008 ip_rt_put(rt);
1009 if (free)
1010 kfree(ipc.opt);
1011 if (!err)
1012 return len;
1013 /*
1014 * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
1015 * ENOBUFS might not be good (it's not tunable per se), but otherwise
1016 * we don't have a good statistic (IpOutDiscards but it can be too many
1017 * things). We could add another new stat but at least for now that
1018 * seems like overkill.
1019 */
1020 if (err == -ENOBUFS || test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
1021 UDP_INC_STATS_USER(sock_net(sk),
1022 UDP_MIB_SNDBUFERRORS, is_udplite);
1023 }
1024 return err;
1025
1026do_confirm:
1027 dst_confirm(&rt->dst);
1028 if (!(msg->msg_flags&MSG_PROBE) || len)
1029 goto back_from_confirm;
1030 err = 0;
1031 goto out;
1032}
1033EXPORT_SYMBOL(udp_sendmsg);
1034
1035int udp_sendpage(struct sock *sk, struct page *page, int offset,
1036 size_t size, int flags)
1037{
1038 struct inet_sock *inet = inet_sk(sk);
1039 struct udp_sock *up = udp_sk(sk);
1040 int ret;
1041
1042 if (!up->pending) {
1043 struct msghdr msg = { .msg_flags = flags|MSG_MORE };
1044
1045 /* Call udp_sendmsg to specify destination address which
1046 * sendpage interface can't pass.
1047 * This will succeed only when the socket is connected.
1048 */
1049 ret = udp_sendmsg(NULL, sk, &msg, 0);
1050 if (ret < 0)
1051 return ret;
1052 }
1053
1054 lock_sock(sk);
1055
1056 if (unlikely(!up->pending)) {
1057 release_sock(sk);
1058
1059 LIMIT_NETDEBUG(KERN_DEBUG pr_fmt("udp cork app bug 3\n"));
1060 return -EINVAL;
1061 }
1062
1063 ret = ip_append_page(sk, &inet->cork.fl.u.ip4,
1064 page, offset, size, flags);
1065 if (ret == -EOPNOTSUPP) {
1066 release_sock(sk);
1067 return sock_no_sendpage(sk->sk_socket, page, offset,
1068 size, flags);
1069 }
1070 if (ret < 0) {
1071 udp_flush_pending_frames(sk);
1072 goto out;
1073 }
1074
1075 up->len += size;
1076 if (!(up->corkflag || (flags&MSG_MORE)))
1077 ret = udp_push_pending_frames(sk);
1078 if (!ret)
1079 ret = size;
1080out:
1081 release_sock(sk);
1082 return ret;
1083}
1084
1085
1086/**
1087 * first_packet_length - return length of first packet in receive queue
1088 * @sk: socket
1089 *
1090 * Drops all bad checksum frames, until a valid one is found.
1091 * Returns the length of found skb, or 0 if none is found.
1092 */
1093static unsigned int first_packet_length(struct sock *sk)
1094{
1095 struct sk_buff_head list_kill, *rcvq = &sk->sk_receive_queue;
1096 struct sk_buff *skb;
1097 unsigned int res;
1098
1099 __skb_queue_head_init(&list_kill);
1100
1101 spin_lock_bh(&rcvq->lock);
1102 while ((skb = skb_peek(rcvq)) != NULL &&
1103 udp_lib_checksum_complete(skb)) {
1104 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS,
1105 IS_UDPLITE(sk));
1106 atomic_inc(&sk->sk_drops);
1107 __skb_unlink(skb, rcvq);
1108 __skb_queue_tail(&list_kill, skb);
1109 }
1110 res = skb ? skb->len : 0;
1111 spin_unlock_bh(&rcvq->lock);
1112
1113 if (!skb_queue_empty(&list_kill)) {
1114 bool slow = lock_sock_fast(sk);
1115
1116 __skb_queue_purge(&list_kill);
1117 sk_mem_reclaim_partial(sk);
1118 unlock_sock_fast(sk, slow);
1119 }
1120 return res;
1121}
1122
1123/*
1124 * IOCTL requests applicable to the UDP protocol
1125 */
1126
1127int udp_ioctl(struct sock *sk, int cmd, unsigned long arg)
1128{
1129 switch (cmd) {
1130 case SIOCOUTQ:
1131 {
1132 int amount = sk_wmem_alloc_get(sk);
1133
1134 return put_user(amount, (int __user *)arg);
1135 }
1136
1137 case SIOCINQ:
1138 {
1139 unsigned int amount = first_packet_length(sk);
1140
1141 if (amount)
1142 /*
1143 * We will only return the amount
1144 * of this packet since that is all
1145 * that will be read.
1146 */
1147 amount -= sizeof(struct udphdr);
1148
1149 return put_user(amount, (int __user *)arg);
1150 }
1151
1152 default:
1153 return -ENOIOCTLCMD;
1154 }
1155
1156 return 0;
1157}
1158EXPORT_SYMBOL(udp_ioctl);
1159
1160/*
1161 * This should be easy, if there is something there we
1162 * return it, otherwise we block.
1163 */
1164
1165int udp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
1166 size_t len, int noblock, int flags, int *addr_len)
1167{
1168 struct inet_sock *inet = inet_sk(sk);
1169 struct sockaddr_in *sin = (struct sockaddr_in *)msg->msg_name;
1170 struct sk_buff *skb;
1171 unsigned int ulen, copied;
1172 int peeked, off = 0;
1173 int err;
1174 int is_udplite = IS_UDPLITE(sk);
1175 bool slow;
1176
1177 /*
1178 * Check any passed addresses
1179 */
1180 if (addr_len)
1181 *addr_len = sizeof(*sin);
1182
1183 if (flags & MSG_ERRQUEUE)
1184 return ip_recv_error(sk, msg, len);
1185
1186try_again:
1187 skb = __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0),
1188 &peeked, &off, &err);
1189 if (!skb)
1190 goto out;
1191
1192 ulen = skb->len - sizeof(struct udphdr);
1193 copied = len;
1194 if (copied > ulen)
1195 copied = ulen;
1196 else if (copied < ulen)
1197 msg->msg_flags |= MSG_TRUNC;
1198
1199 /*
1200 * If checksum is needed at all, try to do it while copying the
1201 * data. If the data is truncated, or if we only want a partial
1202 * coverage checksum (UDP-Lite), do it before the copy.
1203 */
1204
1205 if (copied < ulen || UDP_SKB_CB(skb)->partial_cov) {
1206 if (udp_lib_checksum_complete(skb))
1207 goto csum_copy_err;
1208 }
1209
1210 if (skb_csum_unnecessary(skb))
1211 err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr),
1212 msg->msg_iov, copied);
1213 else {
1214 err = skb_copy_and_csum_datagram_iovec(skb,
1215 sizeof(struct udphdr),
1216 msg->msg_iov);
1217
1218 if (err == -EINVAL)
1219 goto csum_copy_err;
1220 }
1221
1222 if (err)
1223 goto out_free;
1224
1225 if (!peeked)
1226 UDP_INC_STATS_USER(sock_net(sk),
1227 UDP_MIB_INDATAGRAMS, is_udplite);
1228
1229 sock_recv_ts_and_drops(msg, sk, skb);
1230
1231 /* Copy the address. */
1232 if (sin) {
1233 sin->sin_family = AF_INET;
1234 sin->sin_port = udp_hdr(skb)->source;
1235 sin->sin_addr.s_addr = ip_hdr(skb)->saddr;
1236 memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
1237 }
1238 if (inet->cmsg_flags)
1239 ip_cmsg_recv(msg, skb);
1240
1241 err = copied;
1242 if (flags & MSG_TRUNC)
1243 err = ulen;
1244
1245out_free:
1246 skb_free_datagram_locked(sk, skb);
1247out:
1248 return err;
1249
1250csum_copy_err:
1251 slow = lock_sock_fast(sk);
1252 if (!skb_kill_datagram(sk, skb, flags))
1253 UDP_INC_STATS_USER(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1254 unlock_sock_fast(sk, slow);
1255
1256 if (noblock)
1257 return -EAGAIN;
1258
1259 /* starting over for a new packet */
1260 msg->msg_flags &= ~MSG_TRUNC;
1261 goto try_again;
1262}
1263
1264
1265int udp_disconnect(struct sock *sk, int flags)
1266{
1267 struct inet_sock *inet = inet_sk(sk);
1268 /*
1269 * 1003.1g - break association.
1270 */
1271
1272 sk->sk_state = TCP_CLOSE;
1273 inet->inet_daddr = 0;
1274 inet->inet_dport = 0;
1275 sock_rps_reset_rxhash(sk);
1276 sk->sk_bound_dev_if = 0;
1277 if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
1278 inet_reset_saddr(sk);
1279
1280 if (!(sk->sk_userlocks & SOCK_BINDPORT_LOCK)) {
1281 sk->sk_prot->unhash(sk);
1282 inet->inet_sport = 0;
1283 }
1284 sk_dst_reset(sk);
1285 return 0;
1286}
1287EXPORT_SYMBOL(udp_disconnect);
1288
1289void udp_lib_unhash(struct sock *sk)
1290{
1291 if (sk_hashed(sk)) {
1292 struct udp_table *udptable = sk->sk_prot->h.udp_table;
1293 struct udp_hslot *hslot, *hslot2;
1294
1295 hslot = udp_hashslot(udptable, sock_net(sk),
1296 udp_sk(sk)->udp_port_hash);
1297 hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
1298
1299 spin_lock_bh(&hslot->lock);
1300 if (sk_nulls_del_node_init_rcu(sk)) {
1301 hslot->count--;
1302 inet_sk(sk)->inet_num = 0;
1303 sock_prot_inuse_add(sock_net(sk), sk->sk_prot, -1);
1304
1305 spin_lock(&hslot2->lock);
1306 hlist_nulls_del_init_rcu(&udp_sk(sk)->udp_portaddr_node);
1307 hslot2->count--;
1308 spin_unlock(&hslot2->lock);
1309 }
1310 spin_unlock_bh(&hslot->lock);
1311 }
1312}
1313EXPORT_SYMBOL(udp_lib_unhash);
1314
1315/*
1316 * inet_rcv_saddr was changed, we must rehash secondary hash
1317 */
1318void udp_lib_rehash(struct sock *sk, u16 newhash)
1319{
1320 if (sk_hashed(sk)) {
1321 struct udp_table *udptable = sk->sk_prot->h.udp_table;
1322 struct udp_hslot *hslot, *hslot2, *nhslot2;
1323
1324 hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
1325 nhslot2 = udp_hashslot2(udptable, newhash);
1326 udp_sk(sk)->udp_portaddr_hash = newhash;
1327 if (hslot2 != nhslot2) {
1328 hslot = udp_hashslot(udptable, sock_net(sk),
1329 udp_sk(sk)->udp_port_hash);
1330 /* we must lock primary chain too */
1331 spin_lock_bh(&hslot->lock);
1332
1333 spin_lock(&hslot2->lock);
1334 hlist_nulls_del_init_rcu(&udp_sk(sk)->udp_portaddr_node);
1335 hslot2->count--;
1336 spin_unlock(&hslot2->lock);
1337
1338 spin_lock(&nhslot2->lock);
1339 hlist_nulls_add_head_rcu(&udp_sk(sk)->udp_portaddr_node,
1340 &nhslot2->head);
1341 nhslot2->count++;
1342 spin_unlock(&nhslot2->lock);
1343
1344 spin_unlock_bh(&hslot->lock);
1345 }
1346 }
1347}
1348EXPORT_SYMBOL(udp_lib_rehash);
1349
1350static void udp_v4_rehash(struct sock *sk)
1351{
1352 u16 new_hash = udp4_portaddr_hash(sock_net(sk),
1353 inet_sk(sk)->inet_rcv_saddr,
1354 inet_sk(sk)->inet_num);
1355 udp_lib_rehash(sk, new_hash);
1356}
1357
1358static int __udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
1359{
1360 int rc;
1361
1362 if (inet_sk(sk)->inet_daddr)
1363 sock_rps_save_rxhash(sk, skb);
1364
1365 rc = sock_queue_rcv_skb(sk, skb);
1366 if (rc < 0) {
1367 int is_udplite = IS_UDPLITE(sk);
1368
1369 /* Note that an ENOMEM error is charged twice */
1370 if (rc == -ENOMEM)
1371 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
1372 is_udplite);
1373 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1374 kfree_skb(skb);
1375 trace_udp_fail_queue_rcv_skb(rc, sk);
1376 return -1;
1377 }
1378
1379 return 0;
1380
1381}
1382
1383static struct static_key udp_encap_needed __read_mostly;
1384void udp_encap_enable(void)
1385{
1386 if (!static_key_enabled(&udp_encap_needed))
1387 static_key_slow_inc(&udp_encap_needed);
1388}
1389EXPORT_SYMBOL(udp_encap_enable);
1390
1391/* returns:
1392 * -1: error
1393 * 0: success
1394 * >0: "udp encap" protocol resubmission
1395 *
1396 * Note that in the success and error cases, the skb is assumed to
1397 * have either been requeued or freed.
1398 */
1399int udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
1400{
1401 struct udp_sock *up = udp_sk(sk);
1402 int rc;
1403 int is_udplite = IS_UDPLITE(sk);
1404
1405 /*
1406 * Charge it to the socket, dropping if the queue is full.
1407 */
1408 if (!xfrm4_policy_check(sk, XFRM_POLICY_IN, skb))
1409 goto drop;
1410 nf_reset(skb);
1411
1412 if (static_key_false(&udp_encap_needed) && up->encap_type) {
1413 int (*encap_rcv)(struct sock *sk, struct sk_buff *skb);
1414
1415 /*
1416 * This is an encapsulation socket so pass the skb to
1417 * the socket's udp_encap_rcv() hook. Otherwise, just
1418 * fall through and pass this up the UDP socket.
1419 * up->encap_rcv() returns the following value:
1420 * =0 if skb was successfully passed to the encap
1421 * handler or was discarded by it.
1422 * >0 if skb should be passed on to UDP.
1423 * <0 if skb should be resubmitted as proto -N
1424 */
1425
1426 /* if we're overly short, let UDP handle it */
1427 encap_rcv = ACCESS_ONCE(up->encap_rcv);
1428 if (skb->len > sizeof(struct udphdr) && encap_rcv != NULL) {
1429 int ret;
1430
1431 ret = encap_rcv(sk, skb);
1432 if (ret <= 0) {
1433 UDP_INC_STATS_BH(sock_net(sk),
1434 UDP_MIB_INDATAGRAMS,
1435 is_udplite);
1436 return -ret;
1437 }
1438 }
1439
1440 /* FALLTHROUGH -- it's a UDP Packet */
1441 }
1442
1443 /*
1444 * UDP-Lite specific tests, ignored on UDP sockets
1445 */
1446 if ((is_udplite & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) {
1447
1448 /*
1449 * MIB statistics other than incrementing the error count are
1450 * disabled for the following two types of errors: these depend
1451 * on the application settings, not on the functioning of the
1452 * protocol stack as such.
1453 *
1454 * RFC 3828 here recommends (sec 3.3): "There should also be a
1455 * way ... to ... at least let the receiving application block
1456 * delivery of packets with coverage values less than a value
1457 * provided by the application."
1458 */
1459 if (up->pcrlen == 0) { /* full coverage was set */
1460 LIMIT_NETDEBUG(KERN_WARNING "UDPLite: partial coverage %d while full coverage %d requested\n",
1461 UDP_SKB_CB(skb)->cscov, skb->len);
1462 goto drop;
1463 }
1464 /* The next case involves violating the min. coverage requested
1465 * by the receiver. This is subtle: if receiver wants x and x is
1466 * greater than the buffersize/MTU then receiver will complain
1467 * that it wants x while sender emits packets of smaller size y.
1468 * Therefore the above ...()->partial_cov statement is essential.
1469 */
1470 if (UDP_SKB_CB(skb)->cscov < up->pcrlen) {
1471 LIMIT_NETDEBUG(KERN_WARNING "UDPLite: coverage %d too small, need min %d\n",
1472 UDP_SKB_CB(skb)->cscov, up->pcrlen);
1473 goto drop;
1474 }
1475 }
1476
1477 if (rcu_access_pointer(sk->sk_filter) &&
1478 udp_lib_checksum_complete(skb))
1479 goto drop;
1480
1481
1482 if (sk_rcvqueues_full(sk, skb, sk->sk_rcvbuf))
1483 goto drop;
1484
1485 rc = 0;
1486
1487 ipv4_pktinfo_prepare(skb);
1488 bh_lock_sock(sk);
1489 if (!sock_owned_by_user(sk))
1490 rc = __udp_queue_rcv_skb(sk, skb);
1491 else if (sk_add_backlog(sk, skb, sk->sk_rcvbuf)) {
1492 bh_unlock_sock(sk);
1493 goto drop;
1494 }
1495 bh_unlock_sock(sk);
1496
1497 return rc;
1498
1499drop:
1500 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
1501 atomic_inc(&sk->sk_drops);
1502 kfree_skb(skb);
1503 return -1;
1504}
1505
1506
1507static void flush_stack(struct sock **stack, unsigned int count,
1508 struct sk_buff *skb, unsigned int final)
1509{
1510 unsigned int i;
1511 struct sk_buff *skb1 = NULL;
1512 struct sock *sk;
1513
1514 for (i = 0; i < count; i++) {
1515 sk = stack[i];
1516 if (likely(skb1 == NULL))
1517 skb1 = (i == final) ? skb : skb_clone(skb, GFP_ATOMIC);
1518
1519 if (!skb1) {
1520 atomic_inc(&sk->sk_drops);
1521 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
1522 IS_UDPLITE(sk));
1523 UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS,
1524 IS_UDPLITE(sk));
1525 }
1526
1527 if (skb1 && udp_queue_rcv_skb(sk, skb1) <= 0)
1528 skb1 = NULL;
1529 }
1530 if (unlikely(skb1))
1531 kfree_skb(skb1);
1532}
1533
1534/*
1535 * Multicasts and broadcasts go to each listener.
1536 *
1537 * Note: called only from the BH handler context.
1538 */
1539static int __udp4_lib_mcast_deliver(struct net *net, struct sk_buff *skb,
1540 struct udphdr *uh,
1541 __be32 saddr, __be32 daddr,
1542 struct udp_table *udptable)
1543{
1544 struct sock *sk, *stack[256 / sizeof(struct sock *)];
1545 struct udp_hslot *hslot = udp_hashslot(udptable, net, ntohs(uh->dest));
1546 int dif;
1547 unsigned int i, count = 0;
1548
1549 spin_lock(&hslot->lock);
1550 sk = sk_nulls_head(&hslot->head);
1551 dif = skb->dev->ifindex;
1552 sk = udp_v4_mcast_next(net, sk, uh->dest, daddr, uh->source, saddr, dif);
1553 while (sk) {
1554 stack[count++] = sk;
1555 sk = udp_v4_mcast_next(net, sk_nulls_next(sk), uh->dest,
1556 daddr, uh->source, saddr, dif);
1557 if (unlikely(count == ARRAY_SIZE(stack))) {
1558 if (!sk)
1559 break;
1560 flush_stack(stack, count, skb, ~0);
1561 count = 0;
1562 }
1563 }
1564 /*
1565 * before releasing chain lock, we must take a reference on sockets
1566 */
1567 for (i = 0; i < count; i++)
1568 sock_hold(stack[i]);
1569
1570 spin_unlock(&hslot->lock);
1571
1572 /*
1573 * do the slow work with no lock held
1574 */
1575 if (count) {
1576 flush_stack(stack, count, skb, count - 1);
1577
1578 for (i = 0; i < count; i++)
1579 sock_put(stack[i]);
1580 } else {
1581 kfree_skb(skb);
1582 }
1583 return 0;
1584}
1585
1586/* Initialize UDP checksum. If exited with zero value (success),
1587 * CHECKSUM_UNNECESSARY means, that no more checks are required.
1588 * Otherwise, csum completion requires chacksumming packet body,
1589 * including udp header and folding it to skb->csum.
1590 */
1591static inline int udp4_csum_init(struct sk_buff *skb, struct udphdr *uh,
1592 int proto)
1593{
1594 const struct iphdr *iph;
1595 int err;
1596
1597 UDP_SKB_CB(skb)->partial_cov = 0;
1598 UDP_SKB_CB(skb)->cscov = skb->len;
1599
1600 if (proto == IPPROTO_UDPLITE) {
1601 err = udplite_checksum_init(skb, uh);
1602 if (err)
1603 return err;
1604 }
1605
1606 iph = ip_hdr(skb);
1607 if (uh->check == 0) {
1608 skb->ip_summed = CHECKSUM_UNNECESSARY;
1609 } else if (skb->ip_summed == CHECKSUM_COMPLETE) {
1610 if (!csum_tcpudp_magic(iph->saddr, iph->daddr, skb->len,
1611 proto, skb->csum))
1612 skb->ip_summed = CHECKSUM_UNNECESSARY;
1613 }
1614 if (!skb_csum_unnecessary(skb))
1615 skb->csum = csum_tcpudp_nofold(iph->saddr, iph->daddr,
1616 skb->len, proto, 0);
1617 /* Probably, we should checksum udp header (it should be in cache
1618 * in any case) and data in tiny packets (< rx copybreak).
1619 */
1620
1621 return 0;
1622}
1623
1624/*
1625 * All we need to do is get the socket, and then do a checksum.
1626 */
1627
1628int __udp4_lib_rcv(struct sk_buff *skb, struct udp_table *udptable,
1629 int proto)
1630{
1631 struct sock *sk;
1632 struct udphdr *uh;
1633 unsigned short ulen;
1634 struct rtable *rt = skb_rtable(skb);
1635 __be32 saddr, daddr;
1636 struct net *net = dev_net(skb->dev);
1637
1638 /*
1639 * Validate the packet.
1640 */
1641 if (!pskb_may_pull(skb, sizeof(struct udphdr)))
1642 goto drop; /* No space for header. */
1643
1644 uh = udp_hdr(skb);
1645 ulen = ntohs(uh->len);
1646 saddr = ip_hdr(skb)->saddr;
1647 daddr = ip_hdr(skb)->daddr;
1648
1649 if (ulen > skb->len)
1650 goto short_packet;
1651
1652 if (proto == IPPROTO_UDP) {
1653 /* UDP validates ulen. */
1654 if (ulen < sizeof(*uh) || pskb_trim_rcsum(skb, ulen))
1655 goto short_packet;
1656 uh = udp_hdr(skb);
1657 }
1658
1659 if (udp4_csum_init(skb, uh, proto))
1660 goto csum_error;
1661
1662 if (rt->rt_flags & (RTCF_BROADCAST|RTCF_MULTICAST))
1663 return __udp4_lib_mcast_deliver(net, skb, uh,
1664 saddr, daddr, udptable);
1665
1666 sk = __udp4_lib_lookup_skb(skb, uh->source, uh->dest, udptable);
1667
1668 if (sk != NULL) {
1669 int ret = udp_queue_rcv_skb(sk, skb);
1670 sock_put(sk);
1671
1672 /* a return value > 0 means to resubmit the input, but
1673 * it wants the return to be -protocol, or 0
1674 */
1675 if (ret > 0)
1676 return -ret;
1677 return 0;
1678 }
1679
1680 if (!xfrm4_policy_check(NULL, XFRM_POLICY_IN, skb))
1681 goto drop;
1682 nf_reset(skb);
1683
1684 /* No socket. Drop packet silently, if checksum is wrong */
1685 if (udp_lib_checksum_complete(skb))
1686 goto csum_error;
1687
1688 UDP_INC_STATS_BH(net, UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE);
1689 icmp_send(skb, ICMP_DEST_UNREACH, ICMP_PORT_UNREACH, 0);
1690
1691 /*
1692 * Hmm. We got an UDP packet to a port to which we
1693 * don't wanna listen. Ignore it.
1694 */
1695 kfree_skb(skb);
1696 return 0;
1697
1698short_packet:
1699 LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: short packet: From %pI4:%u %d/%d to %pI4:%u\n",
1700 proto == IPPROTO_UDPLITE ? "Lite" : "",
1701 &saddr, ntohs(uh->source),
1702 ulen, skb->len,
1703 &daddr, ntohs(uh->dest));
1704 goto drop;
1705
1706csum_error:
1707 /*
1708 * RFC1122: OK. Discards the bad packet silently (as far as
1709 * the network is concerned, anyway) as per 4.1.3.4 (MUST).
1710 */
1711 LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: bad checksum. From %pI4:%u to %pI4:%u ulen %d\n",
1712 proto == IPPROTO_UDPLITE ? "Lite" : "",
1713 &saddr, ntohs(uh->source), &daddr, ntohs(uh->dest),
1714 ulen);
1715drop:
1716 UDP_INC_STATS_BH(net, UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE);
1717 kfree_skb(skb);
1718 return 0;
1719}
1720
1721int udp_rcv(struct sk_buff *skb)
1722{
1723 return __udp4_lib_rcv(skb, &udp_table, IPPROTO_UDP);
1724}
1725
1726void udp_destroy_sock(struct sock *sk)
1727{
1728 bool slow = lock_sock_fast(sk);
1729 udp_flush_pending_frames(sk);
1730 unlock_sock_fast(sk, slow);
1731}
1732
1733/*
1734 * Socket option code for UDP
1735 */
1736int udp_lib_setsockopt(struct sock *sk, int level, int optname,
1737 char __user *optval, unsigned int optlen,
1738 int (*push_pending_frames)(struct sock *))
1739{
1740 struct udp_sock *up = udp_sk(sk);
1741 int val;
1742 int err = 0;
1743 int is_udplite = IS_UDPLITE(sk);
1744
1745 if (optlen < sizeof(int))
1746 return -EINVAL;
1747
1748 if (get_user(val, (int __user *)optval))
1749 return -EFAULT;
1750
1751 switch (optname) {
1752 case UDP_CORK:
1753 if (val != 0) {
1754 up->corkflag = 1;
1755 } else {
1756 up->corkflag = 0;
1757 lock_sock(sk);
1758 (*push_pending_frames)(sk);
1759 release_sock(sk);
1760 }
1761 break;
1762
1763 case UDP_ENCAP:
1764 switch (val) {
1765 case 0:
1766 case UDP_ENCAP_ESPINUDP:
1767 case UDP_ENCAP_ESPINUDP_NON_IKE:
1768 up->encap_rcv = xfrm4_udp_encap_rcv;
1769 /* FALLTHROUGH */
1770 case UDP_ENCAP_L2TPINUDP:
1771 up->encap_type = val;
1772 udp_encap_enable();
1773 break;
1774 default:
1775 err = -ENOPROTOOPT;
1776 break;
1777 }
1778 break;
1779
1780 /*
1781 * UDP-Lite's partial checksum coverage (RFC 3828).
1782 */
1783 /* The sender sets actual checksum coverage length via this option.
1784 * The case coverage > packet length is handled by send module. */
1785 case UDPLITE_SEND_CSCOV:
1786 if (!is_udplite) /* Disable the option on UDP sockets */
1787 return -ENOPROTOOPT;
1788 if (val != 0 && val < 8) /* Illegal coverage: use default (8) */
1789 val = 8;
1790 else if (val > USHRT_MAX)
1791 val = USHRT_MAX;
1792 up->pcslen = val;
1793 up->pcflag |= UDPLITE_SEND_CC;
1794 break;
1795
1796 /* The receiver specifies a minimum checksum coverage value. To make
1797 * sense, this should be set to at least 8 (as done below). If zero is
1798 * used, this again means full checksum coverage. */
1799 case UDPLITE_RECV_CSCOV:
1800 if (!is_udplite) /* Disable the option on UDP sockets */
1801 return -ENOPROTOOPT;
1802 if (val != 0 && val < 8) /* Avoid silly minimal values. */
1803 val = 8;
1804 else if (val > USHRT_MAX)
1805 val = USHRT_MAX;
1806 up->pcrlen = val;
1807 up->pcflag |= UDPLITE_RECV_CC;
1808 break;
1809
1810 default:
1811 err = -ENOPROTOOPT;
1812 break;
1813 }
1814
1815 return err;
1816}
1817EXPORT_SYMBOL(udp_lib_setsockopt);
1818
1819int udp_setsockopt(struct sock *sk, int level, int optname,
1820 char __user *optval, unsigned int optlen)
1821{
1822 if (level == SOL_UDP || level == SOL_UDPLITE)
1823 return udp_lib_setsockopt(sk, level, optname, optval, optlen,
1824 udp_push_pending_frames);
1825 return ip_setsockopt(sk, level, optname, optval, optlen);
1826}
1827
1828#ifdef CONFIG_COMPAT
1829int compat_udp_setsockopt(struct sock *sk, int level, int optname,
1830 char __user *optval, unsigned int optlen)
1831{
1832 if (level == SOL_UDP || level == SOL_UDPLITE)
1833 return udp_lib_setsockopt(sk, level, optname, optval, optlen,
1834 udp_push_pending_frames);
1835 return compat_ip_setsockopt(sk, level, optname, optval, optlen);
1836}
1837#endif
1838
1839int udp_lib_getsockopt(struct sock *sk, int level, int optname,
1840 char __user *optval, int __user *optlen)
1841{
1842 struct udp_sock *up = udp_sk(sk);
1843 int val, len;
1844
1845 if (get_user(len, optlen))
1846 return -EFAULT;
1847
1848 len = min_t(unsigned int, len, sizeof(int));
1849
1850 if (len < 0)
1851 return -EINVAL;
1852
1853 switch (optname) {
1854 case UDP_CORK:
1855 val = up->corkflag;
1856 break;
1857
1858 case UDP_ENCAP:
1859 val = up->encap_type;
1860 break;
1861
1862 /* The following two cannot be changed on UDP sockets, the return is
1863 * always 0 (which corresponds to the full checksum coverage of UDP). */
1864 case UDPLITE_SEND_CSCOV:
1865 val = up->pcslen;
1866 break;
1867
1868 case UDPLITE_RECV_CSCOV:
1869 val = up->pcrlen;
1870 break;
1871
1872 default:
1873 return -ENOPROTOOPT;
1874 }
1875
1876 if (put_user(len, optlen))
1877 return -EFAULT;
1878 if (copy_to_user(optval, &val, len))
1879 return -EFAULT;
1880 return 0;
1881}
1882EXPORT_SYMBOL(udp_lib_getsockopt);
1883
1884int udp_getsockopt(struct sock *sk, int level, int optname,
1885 char __user *optval, int __user *optlen)
1886{
1887 if (level == SOL_UDP || level == SOL_UDPLITE)
1888 return udp_lib_getsockopt(sk, level, optname, optval, optlen);
1889 return ip_getsockopt(sk, level, optname, optval, optlen);
1890}
1891
1892#ifdef CONFIG_COMPAT
1893int compat_udp_getsockopt(struct sock *sk, int level, int optname,
1894 char __user *optval, int __user *optlen)
1895{
1896 if (level == SOL_UDP || level == SOL_UDPLITE)
1897 return udp_lib_getsockopt(sk, level, optname, optval, optlen);
1898 return compat_ip_getsockopt(sk, level, optname, optval, optlen);
1899}
1900#endif
1901/**
1902 * udp_poll - wait for a UDP event.
1903 * @file - file struct
1904 * @sock - socket
1905 * @wait - poll table
1906 *
1907 * This is same as datagram poll, except for the special case of
1908 * blocking sockets. If application is using a blocking fd
1909 * and a packet with checksum error is in the queue;
1910 * then it could get return from select indicating data available
1911 * but then block when reading it. Add special case code
1912 * to work around these arguably broken applications.
1913 */
1914unsigned int udp_poll(struct file *file, struct socket *sock, poll_table *wait)
1915{
1916 unsigned int mask = datagram_poll(file, sock, wait);
1917 struct sock *sk = sock->sk;
1918
1919 /* Check for false positives due to checksum errors */
1920 if ((mask & POLLRDNORM) && !(file->f_flags & O_NONBLOCK) &&
1921 !(sk->sk_shutdown & RCV_SHUTDOWN) && !first_packet_length(sk))
1922 mask &= ~(POLLIN | POLLRDNORM);
1923
1924 return mask;
1925
1926}
1927EXPORT_SYMBOL(udp_poll);
1928
1929struct proto udp_prot = {
1930 .name = "UDP",
1931 .owner = THIS_MODULE,
1932 .close = udp_lib_close,
1933 .connect = ip4_datagram_connect,
1934 .disconnect = udp_disconnect,
1935 .ioctl = udp_ioctl,
1936 .destroy = udp_destroy_sock,
1937 .setsockopt = udp_setsockopt,
1938 .getsockopt = udp_getsockopt,
1939 .sendmsg = udp_sendmsg,
1940 .recvmsg = udp_recvmsg,
1941 .sendpage = udp_sendpage,
1942 .backlog_rcv = __udp_queue_rcv_skb,
1943 .hash = udp_lib_hash,
1944 .unhash = udp_lib_unhash,
1945 .rehash = udp_v4_rehash,
1946 .get_port = udp_v4_get_port,
1947 .memory_allocated = &udp_memory_allocated,
1948 .sysctl_mem = sysctl_udp_mem,
1949 .sysctl_wmem = &sysctl_udp_wmem_min,
1950 .sysctl_rmem = &sysctl_udp_rmem_min,
1951 .obj_size = sizeof(struct udp_sock),
1952 .slab_flags = SLAB_DESTROY_BY_RCU,
1953 .h.udp_table = &udp_table,
1954#ifdef CONFIG_COMPAT
1955 .compat_setsockopt = compat_udp_setsockopt,
1956 .compat_getsockopt = compat_udp_getsockopt,
1957#endif
1958 .clear_sk = sk_prot_clear_portaddr_nulls,
1959};
1960EXPORT_SYMBOL(udp_prot);
1961
1962/* ------------------------------------------------------------------------ */
1963#ifdef CONFIG_PROC_FS
1964
1965static struct sock *udp_get_first(struct seq_file *seq, int start)
1966{
1967 struct sock *sk;
1968 struct udp_iter_state *state = seq->private;
1969 struct net *net = seq_file_net(seq);
1970
1971 for (state->bucket = start; state->bucket <= state->udp_table->mask;
1972 ++state->bucket) {
1973 struct hlist_nulls_node *node;
1974 struct udp_hslot *hslot = &state->udp_table->hash[state->bucket];
1975
1976 if (hlist_nulls_empty(&hslot->head))
1977 continue;
1978
1979 spin_lock_bh(&hslot->lock);
1980 sk_nulls_for_each(sk, node, &hslot->head) {
1981 if (!net_eq(sock_net(sk), net))
1982 continue;
1983 if (sk->sk_family == state->family)
1984 goto found;
1985 }
1986 spin_unlock_bh(&hslot->lock);
1987 }
1988 sk = NULL;
1989found:
1990 return sk;
1991}
1992
1993static struct sock *udp_get_next(struct seq_file *seq, struct sock *sk)
1994{
1995 struct udp_iter_state *state = seq->private;
1996 struct net *net = seq_file_net(seq);
1997
1998 do {
1999 sk = sk_nulls_next(sk);
2000 } while (sk && (!net_eq(sock_net(sk), net) || sk->sk_family != state->family));
2001
2002 if (!sk) {
2003 if (state->bucket <= state->udp_table->mask)
2004 spin_unlock_bh(&state->udp_table->hash[state->bucket].lock);
2005 return udp_get_first(seq, state->bucket + 1);
2006 }
2007 return sk;
2008}
2009
2010static struct sock *udp_get_idx(struct seq_file *seq, loff_t pos)
2011{
2012 struct sock *sk = udp_get_first(seq, 0);
2013
2014 if (sk)
2015 while (pos && (sk = udp_get_next(seq, sk)) != NULL)
2016 --pos;
2017 return pos ? NULL : sk;
2018}
2019
2020static void *udp_seq_start(struct seq_file *seq, loff_t *pos)
2021{
2022 struct udp_iter_state *state = seq->private;
2023 state->bucket = MAX_UDP_PORTS;
2024
2025 return *pos ? udp_get_idx(seq, *pos-1) : SEQ_START_TOKEN;
2026}
2027
2028static void *udp_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2029{
2030 struct sock *sk;
2031
2032 if (v == SEQ_START_TOKEN)
2033 sk = udp_get_idx(seq, 0);
2034 else
2035 sk = udp_get_next(seq, v);
2036
2037 ++*pos;
2038 return sk;
2039}
2040
2041static void udp_seq_stop(struct seq_file *seq, void *v)
2042{
2043 struct udp_iter_state *state = seq->private;
2044
2045 if (state->bucket <= state->udp_table->mask)
2046 spin_unlock_bh(&state->udp_table->hash[state->bucket].lock);
2047}
2048
2049int udp_seq_open(struct inode *inode, struct file *file)
2050{
2051 struct udp_seq_afinfo *afinfo = PDE(inode)->data;
2052 struct udp_iter_state *s;
2053 int err;
2054
2055 err = seq_open_net(inode, file, &afinfo->seq_ops,
2056 sizeof(struct udp_iter_state));
2057 if (err < 0)
2058 return err;
2059
2060 s = ((struct seq_file *)file->private_data)->private;
2061 s->family = afinfo->family;
2062 s->udp_table = afinfo->udp_table;
2063 return err;
2064}
2065EXPORT_SYMBOL(udp_seq_open);
2066
2067/* ------------------------------------------------------------------------ */
2068int udp_proc_register(struct net *net, struct udp_seq_afinfo *afinfo)
2069{
2070 struct proc_dir_entry *p;
2071 int rc = 0;
2072
2073 afinfo->seq_ops.start = udp_seq_start;
2074 afinfo->seq_ops.next = udp_seq_next;
2075 afinfo->seq_ops.stop = udp_seq_stop;
2076
2077 p = proc_create_data(afinfo->name, S_IRUGO, net->proc_net,
2078 afinfo->seq_fops, afinfo);
2079 if (!p)
2080 rc = -ENOMEM;
2081 return rc;
2082}
2083EXPORT_SYMBOL(udp_proc_register);
2084
2085void udp_proc_unregister(struct net *net, struct udp_seq_afinfo *afinfo)
2086{
2087 proc_net_remove(net, afinfo->name);
2088}
2089EXPORT_SYMBOL(udp_proc_unregister);
2090
2091/* ------------------------------------------------------------------------ */
2092static void udp4_format_sock(struct sock *sp, struct seq_file *f,
2093 int bucket, int *len)
2094{
2095 struct inet_sock *inet = inet_sk(sp);
2096 __be32 dest = inet->inet_daddr;
2097 __be32 src = inet->inet_rcv_saddr;
2098 __u16 destp = ntohs(inet->inet_dport);
2099 __u16 srcp = ntohs(inet->inet_sport);
2100
2101 seq_printf(f, "%5d: %08X:%04X %08X:%04X"
2102 " %02X %08X:%08X %02X:%08lX %08X %5d %8d %lu %d %pK %d%n",
2103 bucket, src, srcp, dest, destp, sp->sk_state,
2104 sk_wmem_alloc_get(sp),
2105 sk_rmem_alloc_get(sp),
2106 0, 0L, 0, sock_i_uid(sp), 0, sock_i_ino(sp),
2107 atomic_read(&sp->sk_refcnt), sp,
2108 atomic_read(&sp->sk_drops), len);
2109}
2110
2111int udp4_seq_show(struct seq_file *seq, void *v)
2112{
2113 if (v == SEQ_START_TOKEN)
2114 seq_printf(seq, "%-127s\n",
2115 " sl local_address rem_address st tx_queue "
2116 "rx_queue tr tm->when retrnsmt uid timeout "
2117 "inode ref pointer drops");
2118 else {
2119 struct udp_iter_state *state = seq->private;
2120 int len;
2121
2122 udp4_format_sock(v, seq, state->bucket, &len);
2123 seq_printf(seq, "%*s\n", 127 - len, "");
2124 }
2125 return 0;
2126}
2127
2128static const struct file_operations udp_afinfo_seq_fops = {
2129 .owner = THIS_MODULE,
2130 .open = udp_seq_open,
2131 .read = seq_read,
2132 .llseek = seq_lseek,
2133 .release = seq_release_net
2134};
2135
2136/* ------------------------------------------------------------------------ */
2137static struct udp_seq_afinfo udp4_seq_afinfo = {
2138 .name = "udp",
2139 .family = AF_INET,
2140 .udp_table = &udp_table,
2141 .seq_fops = &udp_afinfo_seq_fops,
2142 .seq_ops = {
2143 .show = udp4_seq_show,
2144 },
2145};
2146
2147static int __net_init udp4_proc_init_net(struct net *net)
2148{
2149 return udp_proc_register(net, &udp4_seq_afinfo);
2150}
2151
2152static void __net_exit udp4_proc_exit_net(struct net *net)
2153{
2154 udp_proc_unregister(net, &udp4_seq_afinfo);
2155}
2156
2157static struct pernet_operations udp4_net_ops = {
2158 .init = udp4_proc_init_net,
2159 .exit = udp4_proc_exit_net,
2160};
2161
2162int __init udp4_proc_init(void)
2163{
2164 return register_pernet_subsys(&udp4_net_ops);
2165}
2166
2167void udp4_proc_exit(void)
2168{
2169 unregister_pernet_subsys(&udp4_net_ops);
2170}
2171#endif /* CONFIG_PROC_FS */
2172
2173static __initdata unsigned long uhash_entries;
2174static int __init set_uhash_entries(char *str)
2175{
2176 ssize_t ret;
2177
2178 if (!str)
2179 return 0;
2180
2181 ret = kstrtoul(str, 0, &uhash_entries);
2182 if (ret)
2183 return 0;
2184
2185 if (uhash_entries && uhash_entries < UDP_HTABLE_SIZE_MIN)
2186 uhash_entries = UDP_HTABLE_SIZE_MIN;
2187 return 1;
2188}
2189__setup("uhash_entries=", set_uhash_entries);
2190
2191void __init udp_table_init(struct udp_table *table, const char *name)
2192{
2193 unsigned int i;
2194
2195 table->hash = alloc_large_system_hash(name,
2196 2 * sizeof(struct udp_hslot),
2197 uhash_entries,
2198 21, /* one slot per 2 MB */
2199 0,
2200 &table->log,
2201 &table->mask,
2202 UDP_HTABLE_SIZE_MIN,
2203 64 * 1024);
2204
2205 table->hash2 = table->hash + (table->mask + 1);
2206 for (i = 0; i <= table->mask; i++) {
2207 INIT_HLIST_NULLS_HEAD(&table->hash[i].head, i);
2208 table->hash[i].count = 0;
2209 spin_lock_init(&table->hash[i].lock);
2210 }
2211 for (i = 0; i <= table->mask; i++) {
2212 INIT_HLIST_NULLS_HEAD(&table->hash2[i].head, i);
2213 table->hash2[i].count = 0;
2214 spin_lock_init(&table->hash2[i].lock);
2215 }
2216}
2217
2218void __init udp_init(void)
2219{
2220 unsigned long limit;
2221
2222 udp_table_init(&udp_table, "UDP");
2223 limit = nr_free_buffer_pages() / 8;
2224 limit = max(limit, 128UL);
2225 sysctl_udp_mem[0] = limit / 4 * 3;
2226 sysctl_udp_mem[1] = limit;
2227 sysctl_udp_mem[2] = sysctl_udp_mem[0] * 2;
2228
2229 sysctl_udp_rmem_min = SK_MEM_QUANTUM;
2230 sysctl_udp_wmem_min = SK_MEM_QUANTUM;
2231}
2232
2233int udp4_ufo_send_check(struct sk_buff *skb)
2234{
2235 const struct iphdr *iph;
2236 struct udphdr *uh;
2237
2238 if (!pskb_may_pull(skb, sizeof(*uh)))
2239 return -EINVAL;
2240
2241 iph = ip_hdr(skb);
2242 uh = udp_hdr(skb);
2243
2244 uh->check = ~csum_tcpudp_magic(iph->saddr, iph->daddr, skb->len,
2245 IPPROTO_UDP, 0);
2246 skb->csum_start = skb_transport_header(skb) - skb->head;
2247 skb->csum_offset = offsetof(struct udphdr, check);
2248 skb->ip_summed = CHECKSUM_PARTIAL;
2249 return 0;
2250}
2251
2252struct sk_buff *udp4_ufo_fragment(struct sk_buff *skb,
2253 netdev_features_t features)
2254{
2255 struct sk_buff *segs = ERR_PTR(-EINVAL);
2256 unsigned int mss;
2257 int offset;
2258 __wsum csum;
2259
2260 mss = skb_shinfo(skb)->gso_size;
2261 if (unlikely(skb->len <= mss))
2262 goto out;
2263
2264 if (skb_gso_ok(skb, features | NETIF_F_GSO_ROBUST)) {
2265 /* Packet is from an untrusted source, reset gso_segs. */
2266 int type = skb_shinfo(skb)->gso_type;
2267
2268 if (unlikely(type & ~(SKB_GSO_UDP | SKB_GSO_DODGY) ||
2269 !(type & (SKB_GSO_UDP))))
2270 goto out;
2271
2272 skb_shinfo(skb)->gso_segs = DIV_ROUND_UP(skb->len, mss);
2273
2274 segs = NULL;
2275 goto out;
2276 }
2277
2278 /* Do software UFO. Complete and fill in the UDP checksum as HW cannot
2279 * do checksum of UDP packets sent as multiple IP fragments.
2280 */
2281 offset = skb_checksum_start_offset(skb);
2282 csum = skb_checksum(skb, offset, skb->len - offset, 0);
2283 offset += skb->csum_offset;
2284 *(__sum16 *)(skb->data + offset) = csum_fold(csum);
2285 skb->ip_summed = CHECKSUM_NONE;
2286
2287 /* Fragment the skb. IP headers of the fragments are updated in
2288 * inet_gso_segment()
2289 */
2290 segs = skb_segment(skb, features);
2291out:
2292 return segs;
2293}
2294