udp.c 37 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510
  1. /*
  2. * UDP over IPv6
  3. * Linux INET6 implementation
  4. *
  5. * Authors:
  6. * Pedro Roque <roque@di.fc.ul.pt>
  7. *
  8. * Based on linux/ipv4/udp.c
  9. *
  10. * Fixes:
  11. * Hideaki YOSHIFUJI : sin6_scope_id support
  12. * YOSHIFUJI Hideaki @USAGI and: Support IPV6_V6ONLY socket option, which
  13. * Alexey Kuznetsov allow both IPv4 and IPv6 sockets to bind
  14. * a single port at the same time.
  15. * Kazunori MIYAZAWA @USAGI: change process style to use ip6_append_data
  16. * YOSHIFUJI Hideaki @USAGI: convert /proc/net/udp6 to seq_file.
  17. *
  18. * This program is free software; you can redistribute it and/or
  19. * modify it under the terms of the GNU General Public License
  20. * as published by the Free Software Foundation; either version
  21. * 2 of the License, or (at your option) any later version.
  22. */
  23. #include <linux/errno.h>
  24. #include <linux/types.h>
  25. #include <linux/socket.h>
  26. #include <linux/sockios.h>
  27. #include <linux/net.h>
  28. #include <linux/in6.h>
  29. #include <linux/netdevice.h>
  30. #include <linux/if_arp.h>
  31. #include <linux/ipv6.h>
  32. #include <linux/icmpv6.h>
  33. #include <linux/init.h>
  34. #include <linux/module.h>
  35. #include <linux/skbuff.h>
  36. #include <linux/slab.h>
  37. #include <asm/uaccess.h>
  38. #include <net/ndisc.h>
  39. #include <net/protocol.h>
  40. #include <net/transp_v6.h>
  41. #include <net/ip6_route.h>
  42. #include <net/raw.h>
  43. #include <net/tcp_states.h>
  44. #include <net/ip6_checksum.h>
  45. #include <net/xfrm.h>
  46. #include <net/inet6_hashtables.h>
  47. #include <net/busy_poll.h>
  48. #include <linux/proc_fs.h>
  49. #include <linux/seq_file.h>
  50. #include <trace/events/skb.h>
  51. #include "udp_impl.h"
  52. static unsigned int udp6_ehashfn(struct net *net,
  53. const struct in6_addr *laddr,
  54. const u16 lport,
  55. const struct in6_addr *faddr,
  56. const __be16 fport)
  57. {
  58. static u32 udp6_ehash_secret __read_mostly;
  59. static u32 udp_ipv6_hash_secret __read_mostly;
  60. u32 lhash, fhash;
  61. net_get_random_once(&udp6_ehash_secret,
  62. sizeof(udp6_ehash_secret));
  63. net_get_random_once(&udp_ipv6_hash_secret,
  64. sizeof(udp_ipv6_hash_secret));
  65. lhash = (__force u32)laddr->s6_addr32[3];
  66. fhash = __ipv6_addr_jhash(faddr, udp_ipv6_hash_secret);
  67. return __inet6_ehashfn(lhash, lport, fhash, fport,
  68. udp_ipv6_hash_secret + net_hash_mix(net));
  69. }
  70. int ipv6_rcv_saddr_equal(const struct sock *sk, const struct sock *sk2)
  71. {
  72. const struct in6_addr *sk2_rcv_saddr6 = inet6_rcv_saddr(sk2);
  73. int sk_ipv6only = ipv6_only_sock(sk);
  74. int sk2_ipv6only = inet_v6_ipv6only(sk2);
  75. int addr_type = ipv6_addr_type(&sk->sk_v6_rcv_saddr);
  76. int addr_type2 = sk2_rcv_saddr6 ? ipv6_addr_type(sk2_rcv_saddr6) : IPV6_ADDR_MAPPED;
  77. /* if both are mapped, treat as IPv4 */
  78. if (addr_type == IPV6_ADDR_MAPPED && addr_type2 == IPV6_ADDR_MAPPED)
  79. return (!sk2_ipv6only &&
  80. (!sk->sk_rcv_saddr || !sk2->sk_rcv_saddr ||
  81. sk->sk_rcv_saddr == sk2->sk_rcv_saddr));
  82. if (addr_type2 == IPV6_ADDR_ANY &&
  83. !(sk2_ipv6only && addr_type == IPV6_ADDR_MAPPED))
  84. return 1;
  85. if (addr_type == IPV6_ADDR_ANY &&
  86. !(sk_ipv6only && addr_type2 == IPV6_ADDR_MAPPED))
  87. return 1;
  88. if (sk2_rcv_saddr6 &&
  89. ipv6_addr_equal(&sk->sk_v6_rcv_saddr, sk2_rcv_saddr6))
  90. return 1;
  91. return 0;
  92. }
  93. static unsigned int udp6_portaddr_hash(struct net *net,
  94. const struct in6_addr *addr6,
  95. unsigned int port)
  96. {
  97. unsigned int hash, mix = net_hash_mix(net);
  98. if (ipv6_addr_any(addr6))
  99. hash = jhash_1word(0, mix);
  100. else if (ipv6_addr_v4mapped(addr6))
  101. hash = jhash_1word((__force u32)addr6->s6_addr32[3], mix);
  102. else
  103. hash = jhash2((__force u32 *)addr6->s6_addr32, 4, mix);
  104. return hash ^ port;
  105. }
  106. int udp_v6_get_port(struct sock *sk, unsigned short snum)
  107. {
  108. unsigned int hash2_nulladdr =
  109. udp6_portaddr_hash(sock_net(sk), &in6addr_any, snum);
  110. unsigned int hash2_partial =
  111. udp6_portaddr_hash(sock_net(sk), &sk->sk_v6_rcv_saddr, 0);
  112. /* precompute partial secondary hash */
  113. udp_sk(sk)->udp_portaddr_hash = hash2_partial;
  114. return udp_lib_get_port(sk, snum, ipv6_rcv_saddr_equal, hash2_nulladdr);
  115. }
  116. static void udp_v6_rehash(struct sock *sk)
  117. {
  118. u16 new_hash = udp6_portaddr_hash(sock_net(sk),
  119. &sk->sk_v6_rcv_saddr,
  120. inet_sk(sk)->inet_num);
  121. udp_lib_rehash(sk, new_hash);
  122. }
  123. static inline int compute_score(struct sock *sk, struct net *net,
  124. unsigned short hnum,
  125. const struct in6_addr *saddr, __be16 sport,
  126. const struct in6_addr *daddr, __be16 dport,
  127. int dif)
  128. {
  129. int score = -1;
  130. if (net_eq(sock_net(sk), net) && udp_sk(sk)->udp_port_hash == hnum &&
  131. sk->sk_family == PF_INET6) {
  132. struct inet_sock *inet = inet_sk(sk);
  133. score = 0;
  134. if (inet->inet_dport) {
  135. if (inet->inet_dport != sport)
  136. return -1;
  137. score++;
  138. }
  139. if (!ipv6_addr_any(&sk->sk_v6_rcv_saddr)) {
  140. if (!ipv6_addr_equal(&sk->sk_v6_rcv_saddr, daddr))
  141. return -1;
  142. score++;
  143. }
  144. if (!ipv6_addr_any(&sk->sk_v6_daddr)) {
  145. if (!ipv6_addr_equal(&sk->sk_v6_daddr, saddr))
  146. return -1;
  147. score++;
  148. }
  149. if (sk->sk_bound_dev_if) {
  150. if (sk->sk_bound_dev_if != dif)
  151. return -1;
  152. score++;
  153. }
  154. }
  155. return score;
  156. }
  157. #define SCORE2_MAX (1 + 1 + 1)
  158. static inline int compute_score2(struct sock *sk, struct net *net,
  159. const struct in6_addr *saddr, __be16 sport,
  160. const struct in6_addr *daddr, unsigned short hnum,
  161. int dif)
  162. {
  163. int score = -1;
  164. if (net_eq(sock_net(sk), net) && udp_sk(sk)->udp_port_hash == hnum &&
  165. sk->sk_family == PF_INET6) {
  166. struct inet_sock *inet = inet_sk(sk);
  167. if (!ipv6_addr_equal(&sk->sk_v6_rcv_saddr, daddr))
  168. return -1;
  169. score = 0;
  170. if (inet->inet_dport) {
  171. if (inet->inet_dport != sport)
  172. return -1;
  173. score++;
  174. }
  175. if (!ipv6_addr_any(&sk->sk_v6_daddr)) {
  176. if (!ipv6_addr_equal(&sk->sk_v6_daddr, saddr))
  177. return -1;
  178. score++;
  179. }
  180. if (sk->sk_bound_dev_if) {
  181. if (sk->sk_bound_dev_if != dif)
  182. return -1;
  183. score++;
  184. }
  185. }
  186. return score;
  187. }
  188. /* called with read_rcu_lock() */
  189. static struct sock *udp6_lib_lookup2(struct net *net,
  190. const struct in6_addr *saddr, __be16 sport,
  191. const struct in6_addr *daddr, unsigned int hnum, int dif,
  192. struct udp_hslot *hslot2, unsigned int slot2)
  193. {
  194. struct sock *sk, *result;
  195. struct hlist_nulls_node *node;
  196. int score, badness, matches = 0, reuseport = 0;
  197. u32 hash = 0;
  198. begin:
  199. result = NULL;
  200. badness = -1;
  201. udp_portaddr_for_each_entry_rcu(sk, node, &hslot2->head) {
  202. score = compute_score2(sk, net, saddr, sport,
  203. daddr, hnum, dif);
  204. if (score > badness) {
  205. result = sk;
  206. badness = score;
  207. reuseport = sk->sk_reuseport;
  208. if (reuseport) {
  209. hash = udp6_ehashfn(net, daddr, hnum,
  210. saddr, sport);
  211. matches = 1;
  212. } else if (score == SCORE2_MAX)
  213. goto exact_match;
  214. } else if (score == badness && reuseport) {
  215. matches++;
  216. if (((u64)hash * matches) >> 32 == 0)
  217. result = sk;
  218. hash = next_pseudo_random32(hash);
  219. }
  220. }
  221. /*
  222. * if the nulls value we got at the end of this lookup is
  223. * not the expected one, we must restart lookup.
  224. * We probably met an item that was moved to another chain.
  225. */
  226. if (get_nulls_value(node) != slot2)
  227. goto begin;
  228. if (result) {
  229. exact_match:
  230. if (unlikely(!atomic_inc_not_zero_hint(&result->sk_refcnt, 2)))
  231. result = NULL;
  232. else if (unlikely(compute_score2(result, net, saddr, sport,
  233. daddr, hnum, dif) < badness)) {
  234. sock_put(result);
  235. goto begin;
  236. }
  237. }
  238. return result;
  239. }
  240. struct sock *__udp6_lib_lookup(struct net *net,
  241. const struct in6_addr *saddr, __be16 sport,
  242. const struct in6_addr *daddr, __be16 dport,
  243. int dif, struct udp_table *udptable)
  244. {
  245. struct sock *sk, *result;
  246. struct hlist_nulls_node *node;
  247. unsigned short hnum = ntohs(dport);
  248. unsigned int hash2, slot2, slot = udp_hashfn(net, hnum, udptable->mask);
  249. struct udp_hslot *hslot2, *hslot = &udptable->hash[slot];
  250. int score, badness, matches = 0, reuseport = 0;
  251. u32 hash = 0;
  252. rcu_read_lock();
  253. if (hslot->count > 10) {
  254. hash2 = udp6_portaddr_hash(net, daddr, hnum);
  255. slot2 = hash2 & udptable->mask;
  256. hslot2 = &udptable->hash2[slot2];
  257. if (hslot->count < hslot2->count)
  258. goto begin;
  259. result = udp6_lib_lookup2(net, saddr, sport,
  260. daddr, hnum, dif,
  261. hslot2, slot2);
  262. if (!result) {
  263. hash2 = udp6_portaddr_hash(net, &in6addr_any, hnum);
  264. slot2 = hash2 & udptable->mask;
  265. hslot2 = &udptable->hash2[slot2];
  266. if (hslot->count < hslot2->count)
  267. goto begin;
  268. result = udp6_lib_lookup2(net, saddr, sport,
  269. &in6addr_any, hnum, dif,
  270. hslot2, slot2);
  271. }
  272. rcu_read_unlock();
  273. return result;
  274. }
  275. begin:
  276. result = NULL;
  277. badness = -1;
  278. sk_nulls_for_each_rcu(sk, node, &hslot->head) {
  279. score = compute_score(sk, net, hnum, saddr, sport, daddr, dport, dif);
  280. if (score > badness) {
  281. result = sk;
  282. badness = score;
  283. reuseport = sk->sk_reuseport;
  284. if (reuseport) {
  285. hash = udp6_ehashfn(net, daddr, hnum,
  286. saddr, sport);
  287. matches = 1;
  288. }
  289. } else if (score == badness && reuseport) {
  290. matches++;
  291. if (((u64)hash * matches) >> 32 == 0)
  292. result = sk;
  293. hash = next_pseudo_random32(hash);
  294. }
  295. }
  296. /*
  297. * if the nulls value we got at the end of this lookup is
  298. * not the expected one, we must restart lookup.
  299. * We probably met an item that was moved to another chain.
  300. */
  301. if (get_nulls_value(node) != slot)
  302. goto begin;
  303. if (result) {
  304. if (unlikely(!atomic_inc_not_zero_hint(&result->sk_refcnt, 2)))
  305. result = NULL;
  306. else if (unlikely(compute_score(result, net, hnum, saddr, sport,
  307. daddr, dport, dif) < badness)) {
  308. sock_put(result);
  309. goto begin;
  310. }
  311. }
  312. rcu_read_unlock();
  313. return result;
  314. }
  315. EXPORT_SYMBOL_GPL(__udp6_lib_lookup);
  316. static struct sock *__udp6_lib_lookup_skb(struct sk_buff *skb,
  317. __be16 sport, __be16 dport,
  318. struct udp_table *udptable)
  319. {
  320. struct sock *sk;
  321. const struct ipv6hdr *iph = ipv6_hdr(skb);
  322. if (unlikely(sk = skb_steal_sock(skb)))
  323. return sk;
  324. return __udp6_lib_lookup(dev_net(skb_dst(skb)->dev), &iph->saddr, sport,
  325. &iph->daddr, dport, inet6_iif(skb),
  326. udptable);
  327. }
  328. struct sock *udp6_lib_lookup(struct net *net, const struct in6_addr *saddr, __be16 sport,
  329. const struct in6_addr *daddr, __be16 dport, int dif)
  330. {
  331. return __udp6_lib_lookup(net, saddr, sport, daddr, dport, dif, &udp_table);
  332. }
  333. EXPORT_SYMBOL_GPL(udp6_lib_lookup);
  334. /*
  335. * This should be easy, if there is something there we
  336. * return it, otherwise we block.
  337. */
  338. int udpv6_recvmsg(struct kiocb *iocb, struct sock *sk,
  339. struct msghdr *msg, size_t len,
  340. int noblock, int flags, int *addr_len)
  341. {
  342. struct ipv6_pinfo *np = inet6_sk(sk);
  343. struct inet_sock *inet = inet_sk(sk);
  344. struct sk_buff *skb;
  345. unsigned int ulen, copied;
  346. int peeked, off = 0;
  347. int err;
  348. int is_udplite = IS_UDPLITE(sk);
  349. int is_udp4;
  350. bool slow;
  351. if (flags & MSG_ERRQUEUE)
  352. return ipv6_recv_error(sk, msg, len, addr_len);
  353. if (np->rxpmtu && np->rxopt.bits.rxpmtu)
  354. return ipv6_recv_rxpmtu(sk, msg, len, addr_len);
  355. try_again:
  356. skb = __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0),
  357. &peeked, &off, &err);
  358. if (!skb)
  359. goto out;
  360. ulen = skb->len - sizeof(struct udphdr);
  361. copied = len;
  362. if (copied > ulen)
  363. copied = ulen;
  364. else if (copied < ulen)
  365. msg->msg_flags |= MSG_TRUNC;
  366. is_udp4 = (skb->protocol == htons(ETH_P_IP));
  367. /*
  368. * If checksum is needed at all, try to do it while copying the
  369. * data. If the data is truncated, or if we only want a partial
  370. * coverage checksum (UDP-Lite), do it before the copy.
  371. */
  372. if (copied < ulen || UDP_SKB_CB(skb)->partial_cov) {
  373. if (udp_lib_checksum_complete(skb))
  374. goto csum_copy_err;
  375. }
  376. if (skb_csum_unnecessary(skb))
  377. err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr),
  378. msg->msg_iov, copied);
  379. else {
  380. err = skb_copy_and_csum_datagram_iovec(skb, sizeof(struct udphdr), msg->msg_iov);
  381. if (err == -EINVAL)
  382. goto csum_copy_err;
  383. }
  384. if (unlikely(err)) {
  385. trace_kfree_skb(skb, udpv6_recvmsg);
  386. if (!peeked) {
  387. atomic_inc(&sk->sk_drops);
  388. if (is_udp4)
  389. UDP_INC_STATS_USER(sock_net(sk),
  390. UDP_MIB_INERRORS,
  391. is_udplite);
  392. else
  393. UDP6_INC_STATS_USER(sock_net(sk),
  394. UDP_MIB_INERRORS,
  395. is_udplite);
  396. }
  397. goto out_free;
  398. }
  399. if (!peeked) {
  400. if (is_udp4)
  401. UDP_INC_STATS_USER(sock_net(sk),
  402. UDP_MIB_INDATAGRAMS, is_udplite);
  403. else
  404. UDP6_INC_STATS_USER(sock_net(sk),
  405. UDP_MIB_INDATAGRAMS, is_udplite);
  406. }
  407. sock_recv_ts_and_drops(msg, sk, skb);
  408. /* Copy the address. */
  409. if (msg->msg_name) {
  410. DECLARE_SOCKADDR(struct sockaddr_in6 *, sin6, msg->msg_name);
  411. sin6->sin6_family = AF_INET6;
  412. sin6->sin6_port = udp_hdr(skb)->source;
  413. sin6->sin6_flowinfo = 0;
  414. if (is_udp4) {
  415. ipv6_addr_set_v4mapped(ip_hdr(skb)->saddr,
  416. &sin6->sin6_addr);
  417. sin6->sin6_scope_id = 0;
  418. } else {
  419. sin6->sin6_addr = ipv6_hdr(skb)->saddr;
  420. sin6->sin6_scope_id =
  421. ipv6_iface_scope_id(&sin6->sin6_addr,
  422. IP6CB(skb)->iif);
  423. }
  424. *addr_len = sizeof(*sin6);
  425. }
  426. if (np->rxopt.all)
  427. ip6_datagram_recv_common_ctl(sk, msg, skb);
  428. if (is_udp4) {
  429. if (inet->cmsg_flags)
  430. ip_cmsg_recv(msg, skb);
  431. } else {
  432. if (np->rxopt.all)
  433. ip6_datagram_recv_specific_ctl(sk, msg, skb);
  434. }
  435. err = copied;
  436. if (flags & MSG_TRUNC)
  437. err = ulen;
  438. out_free:
  439. skb_free_datagram_locked(sk, skb);
  440. out:
  441. return err;
  442. csum_copy_err:
  443. slow = lock_sock_fast(sk);
  444. if (!skb_kill_datagram(sk, skb, flags)) {
  445. if (is_udp4) {
  446. UDP_INC_STATS_USER(sock_net(sk),
  447. UDP_MIB_CSUMERRORS, is_udplite);
  448. UDP_INC_STATS_USER(sock_net(sk),
  449. UDP_MIB_INERRORS, is_udplite);
  450. } else {
  451. UDP6_INC_STATS_USER(sock_net(sk),
  452. UDP_MIB_CSUMERRORS, is_udplite);
  453. UDP6_INC_STATS_USER(sock_net(sk),
  454. UDP_MIB_INERRORS, is_udplite);
  455. }
  456. }
  457. unlock_sock_fast(sk, slow);
  458. if (noblock)
  459. return -EAGAIN;
  460. /* starting over for a new packet */
  461. msg->msg_flags &= ~MSG_TRUNC;
  462. goto try_again;
  463. }
  464. void __udp6_lib_err(struct sk_buff *skb, struct inet6_skb_parm *opt,
  465. u8 type, u8 code, int offset, __be32 info,
  466. struct udp_table *udptable)
  467. {
  468. struct ipv6_pinfo *np;
  469. const struct ipv6hdr *hdr = (const struct ipv6hdr *)skb->data;
  470. const struct in6_addr *saddr = &hdr->saddr;
  471. const struct in6_addr *daddr = &hdr->daddr;
  472. struct udphdr *uh = (struct udphdr*)(skb->data+offset);
  473. struct sock *sk;
  474. int err;
  475. sk = __udp6_lib_lookup(dev_net(skb->dev), daddr, uh->dest,
  476. saddr, uh->source, inet6_iif(skb), udptable);
  477. if (sk == NULL)
  478. return;
  479. if (type == ICMPV6_PKT_TOOBIG) {
  480. if (!ip6_sk_accept_pmtu(sk))
  481. goto out;
  482. ip6_sk_update_pmtu(skb, sk, info);
  483. }
  484. if (type == NDISC_REDIRECT) {
  485. ip6_sk_redirect(skb, sk);
  486. goto out;
  487. }
  488. np = inet6_sk(sk);
  489. if (!icmpv6_err_convert(type, code, &err) && !np->recverr)
  490. goto out;
  491. if (sk->sk_state != TCP_ESTABLISHED && !np->recverr)
  492. goto out;
  493. if (np->recverr)
  494. ipv6_icmp_error(sk, skb, err, uh->dest, ntohl(info), (u8 *)(uh+1));
  495. sk->sk_err = err;
  496. sk->sk_error_report(sk);
  497. out:
  498. sock_put(sk);
  499. }
  500. static int __udpv6_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
  501. {
  502. int rc;
  503. if (!ipv6_addr_any(&sk->sk_v6_daddr)) {
  504. sock_rps_save_rxhash(sk, skb);
  505. sk_mark_napi_id(sk, skb);
  506. }
  507. rc = sock_queue_rcv_skb(sk, skb);
  508. if (rc < 0) {
  509. int is_udplite = IS_UDPLITE(sk);
  510. /* Note that an ENOMEM error is charged twice */
  511. if (rc == -ENOMEM)
  512. UDP6_INC_STATS_BH(sock_net(sk),
  513. UDP_MIB_RCVBUFERRORS, is_udplite);
  514. UDP6_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
  515. kfree_skb(skb);
  516. return -1;
  517. }
  518. return 0;
  519. }
  520. static __inline__ void udpv6_err(struct sk_buff *skb,
  521. struct inet6_skb_parm *opt, u8 type,
  522. u8 code, int offset, __be32 info )
  523. {
  524. __udp6_lib_err(skb, opt, type, code, offset, info, &udp_table);
  525. }
  526. static struct static_key udpv6_encap_needed __read_mostly;
  527. void udpv6_encap_enable(void)
  528. {
  529. if (!static_key_enabled(&udpv6_encap_needed))
  530. static_key_slow_inc(&udpv6_encap_needed);
  531. }
  532. EXPORT_SYMBOL(udpv6_encap_enable);
  533. int udpv6_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
  534. {
  535. struct udp_sock *up = udp_sk(sk);
  536. int rc;
  537. int is_udplite = IS_UDPLITE(sk);
  538. if (!xfrm6_policy_check(sk, XFRM_POLICY_IN, skb))
  539. goto drop;
  540. if (static_key_false(&udpv6_encap_needed) && up->encap_type) {
  541. int (*encap_rcv)(struct sock *sk, struct sk_buff *skb);
  542. /*
  543. * This is an encapsulation socket so pass the skb to
  544. * the socket's udp_encap_rcv() hook. Otherwise, just
  545. * fall through and pass this up the UDP socket.
  546. * up->encap_rcv() returns the following value:
  547. * =0 if skb was successfully passed to the encap
  548. * handler or was discarded by it.
  549. * >0 if skb should be passed on to UDP.
  550. * <0 if skb should be resubmitted as proto -N
  551. */
  552. /* if we're overly short, let UDP handle it */
  553. encap_rcv = ACCESS_ONCE(up->encap_rcv);
  554. if (skb->len > sizeof(struct udphdr) && encap_rcv != NULL) {
  555. int ret;
  556. ret = encap_rcv(sk, skb);
  557. if (ret <= 0) {
  558. UDP_INC_STATS_BH(sock_net(sk),
  559. UDP_MIB_INDATAGRAMS,
  560. is_udplite);
  561. return -ret;
  562. }
  563. }
  564. /* FALLTHROUGH -- it's a UDP Packet */
  565. }
  566. /*
  567. * UDP-Lite specific tests, ignored on UDP sockets (see net/ipv4/udp.c).
  568. */
  569. if ((is_udplite & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) {
  570. if (up->pcrlen == 0) { /* full coverage was set */
  571. LIMIT_NETDEBUG(KERN_WARNING "UDPLITE6: partial coverage"
  572. " %d while full coverage %d requested\n",
  573. UDP_SKB_CB(skb)->cscov, skb->len);
  574. goto drop;
  575. }
  576. if (UDP_SKB_CB(skb)->cscov < up->pcrlen) {
  577. LIMIT_NETDEBUG(KERN_WARNING "UDPLITE6: coverage %d "
  578. "too small, need min %d\n",
  579. UDP_SKB_CB(skb)->cscov, up->pcrlen);
  580. goto drop;
  581. }
  582. }
  583. if (rcu_access_pointer(sk->sk_filter)) {
  584. if (udp_lib_checksum_complete(skb))
  585. goto csum_error;
  586. }
  587. if (sk_rcvqueues_full(sk, skb, sk->sk_rcvbuf))
  588. goto drop;
  589. skb_dst_drop(skb);
  590. bh_lock_sock(sk);
  591. rc = 0;
  592. if (!sock_owned_by_user(sk))
  593. rc = __udpv6_queue_rcv_skb(sk, skb);
  594. else if (sk_add_backlog(sk, skb, sk->sk_rcvbuf)) {
  595. bh_unlock_sock(sk);
  596. goto drop;
  597. }
  598. bh_unlock_sock(sk);
  599. return rc;
  600. csum_error:
  601. UDP6_INC_STATS_BH(sock_net(sk), UDP_MIB_CSUMERRORS, is_udplite);
  602. drop:
  603. UDP6_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
  604. atomic_inc(&sk->sk_drops);
  605. kfree_skb(skb);
  606. return -1;
  607. }
  608. static struct sock *udp_v6_mcast_next(struct net *net, struct sock *sk,
  609. __be16 loc_port, const struct in6_addr *loc_addr,
  610. __be16 rmt_port, const struct in6_addr *rmt_addr,
  611. int dif)
  612. {
  613. struct hlist_nulls_node *node;
  614. struct sock *s = sk;
  615. unsigned short num = ntohs(loc_port);
  616. sk_nulls_for_each_from(s, node) {
  617. struct inet_sock *inet = inet_sk(s);
  618. if (!net_eq(sock_net(s), net))
  619. continue;
  620. if (udp_sk(s)->udp_port_hash == num &&
  621. s->sk_family == PF_INET6) {
  622. if (inet->inet_dport) {
  623. if (inet->inet_dport != rmt_port)
  624. continue;
  625. }
  626. if (!ipv6_addr_any(&sk->sk_v6_daddr) &&
  627. !ipv6_addr_equal(&sk->sk_v6_daddr, rmt_addr))
  628. continue;
  629. if (s->sk_bound_dev_if && s->sk_bound_dev_if != dif)
  630. continue;
  631. if (!ipv6_addr_any(&sk->sk_v6_rcv_saddr)) {
  632. if (!ipv6_addr_equal(&sk->sk_v6_rcv_saddr, loc_addr))
  633. continue;
  634. }
  635. if (!inet6_mc_check(s, loc_addr, rmt_addr))
  636. continue;
  637. return s;
  638. }
  639. }
  640. return NULL;
  641. }
  642. static void flush_stack(struct sock **stack, unsigned int count,
  643. struct sk_buff *skb, unsigned int final)
  644. {
  645. struct sk_buff *skb1 = NULL;
  646. struct sock *sk;
  647. unsigned int i;
  648. for (i = 0; i < count; i++) {
  649. sk = stack[i];
  650. if (likely(skb1 == NULL))
  651. skb1 = (i == final) ? skb : skb_clone(skb, GFP_ATOMIC);
  652. if (!skb1) {
  653. atomic_inc(&sk->sk_drops);
  654. UDP6_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
  655. IS_UDPLITE(sk));
  656. UDP6_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS,
  657. IS_UDPLITE(sk));
  658. }
  659. if (skb1 && udpv6_queue_rcv_skb(sk, skb1) <= 0)
  660. skb1 = NULL;
  661. }
  662. if (unlikely(skb1))
  663. kfree_skb(skb1);
  664. }
  665. /*
  666. * Note: called only from the BH handler context,
  667. * so we don't need to lock the hashes.
  668. */
  669. static int __udp6_lib_mcast_deliver(struct net *net, struct sk_buff *skb,
  670. const struct in6_addr *saddr, const struct in6_addr *daddr,
  671. struct udp_table *udptable)
  672. {
  673. struct sock *sk, *stack[256 / sizeof(struct sock *)];
  674. const struct udphdr *uh = udp_hdr(skb);
  675. struct udp_hslot *hslot = udp_hashslot(udptable, net, ntohs(uh->dest));
  676. int dif;
  677. unsigned int i, count = 0;
  678. spin_lock(&hslot->lock);
  679. sk = sk_nulls_head(&hslot->head);
  680. dif = inet6_iif(skb);
  681. sk = udp_v6_mcast_next(net, sk, uh->dest, daddr, uh->source, saddr, dif);
  682. while (sk) {
  683. stack[count++] = sk;
  684. sk = udp_v6_mcast_next(net, sk_nulls_next(sk), uh->dest, daddr,
  685. uh->source, saddr, dif);
  686. if (unlikely(count == ARRAY_SIZE(stack))) {
  687. if (!sk)
  688. break;
  689. flush_stack(stack, count, skb, ~0);
  690. count = 0;
  691. }
  692. }
  693. /*
  694. * before releasing the lock, we must take reference on sockets
  695. */
  696. for (i = 0; i < count; i++)
  697. sock_hold(stack[i]);
  698. spin_unlock(&hslot->lock);
  699. if (count) {
  700. flush_stack(stack, count, skb, count - 1);
  701. for (i = 0; i < count; i++)
  702. sock_put(stack[i]);
  703. } else {
  704. kfree_skb(skb);
  705. }
  706. return 0;
  707. }
  708. int __udp6_lib_rcv(struct sk_buff *skb, struct udp_table *udptable,
  709. int proto)
  710. {
  711. struct net *net = dev_net(skb->dev);
  712. struct sock *sk;
  713. struct udphdr *uh;
  714. const struct in6_addr *saddr, *daddr;
  715. u32 ulen = 0;
  716. if (!pskb_may_pull(skb, sizeof(struct udphdr)))
  717. goto discard;
  718. saddr = &ipv6_hdr(skb)->saddr;
  719. daddr = &ipv6_hdr(skb)->daddr;
  720. uh = udp_hdr(skb);
  721. ulen = ntohs(uh->len);
  722. if (ulen > skb->len)
  723. goto short_packet;
  724. if (proto == IPPROTO_UDP) {
  725. /* UDP validates ulen. */
  726. /* Check for jumbo payload */
  727. if (ulen == 0)
  728. ulen = skb->len;
  729. if (ulen < sizeof(*uh))
  730. goto short_packet;
  731. if (ulen < skb->len) {
  732. if (pskb_trim_rcsum(skb, ulen))
  733. goto short_packet;
  734. saddr = &ipv6_hdr(skb)->saddr;
  735. daddr = &ipv6_hdr(skb)->daddr;
  736. uh = udp_hdr(skb);
  737. }
  738. }
  739. if (udp6_csum_init(skb, uh, proto))
  740. goto csum_error;
  741. /*
  742. * Multicast receive code
  743. */
  744. if (ipv6_addr_is_multicast(daddr))
  745. return __udp6_lib_mcast_deliver(net, skb,
  746. saddr, daddr, udptable);
  747. /* Unicast */
  748. /*
  749. * check socket cache ... must talk to Alan about his plans
  750. * for sock caches... i'll skip this for now.
  751. */
  752. sk = __udp6_lib_lookup_skb(skb, uh->source, uh->dest, udptable);
  753. if (sk != NULL) {
  754. int ret;
  755. ret = udpv6_queue_rcv_skb(sk, skb);
  756. sock_put(sk);
  757. /* a return value > 0 means to resubmit the input, but
  758. * it wants the return to be -protocol, or 0
  759. */
  760. if (ret > 0)
  761. return -ret;
  762. return 0;
  763. }
  764. if (!xfrm6_policy_check(NULL, XFRM_POLICY_IN, skb))
  765. goto discard;
  766. if (udp_lib_checksum_complete(skb))
  767. goto csum_error;
  768. UDP6_INC_STATS_BH(net, UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE);
  769. icmpv6_send(skb, ICMPV6_DEST_UNREACH, ICMPV6_PORT_UNREACH, 0);
  770. kfree_skb(skb);
  771. return 0;
  772. short_packet:
  773. LIMIT_NETDEBUG(KERN_DEBUG "UDP%sv6: short packet: From [%pI6c]:%u %d/%d to [%pI6c]:%u\n",
  774. proto == IPPROTO_UDPLITE ? "-Lite" : "",
  775. saddr,
  776. ntohs(uh->source),
  777. ulen,
  778. skb->len,
  779. daddr,
  780. ntohs(uh->dest));
  781. goto discard;
  782. csum_error:
  783. UDP6_INC_STATS_BH(net, UDP_MIB_CSUMERRORS, proto == IPPROTO_UDPLITE);
  784. discard:
  785. UDP6_INC_STATS_BH(net, UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE);
  786. kfree_skb(skb);
  787. return 0;
  788. }
  789. static __inline__ int udpv6_rcv(struct sk_buff *skb)
  790. {
  791. return __udp6_lib_rcv(skb, &udp_table, IPPROTO_UDP);
  792. }
  793. /*
  794. * Throw away all pending data and cancel the corking. Socket is locked.
  795. */
  796. static void udp_v6_flush_pending_frames(struct sock *sk)
  797. {
  798. struct udp_sock *up = udp_sk(sk);
  799. if (up->pending == AF_INET)
  800. udp_flush_pending_frames(sk);
  801. else if (up->pending) {
  802. up->len = 0;
  803. up->pending = 0;
  804. ip6_flush_pending_frames(sk);
  805. }
  806. }
  807. /**
  808. * udp6_hwcsum_outgoing - handle outgoing HW checksumming
  809. * @sk: socket we are sending on
  810. * @skb: sk_buff containing the filled-in UDP header
  811. * (checksum field must be zeroed out)
  812. */
  813. static void udp6_hwcsum_outgoing(struct sock *sk, struct sk_buff *skb,
  814. const struct in6_addr *saddr,
  815. const struct in6_addr *daddr, int len)
  816. {
  817. unsigned int offset;
  818. struct udphdr *uh = udp_hdr(skb);
  819. __wsum csum = 0;
  820. if (skb_queue_len(&sk->sk_write_queue) == 1) {
  821. /* Only one fragment on the socket. */
  822. skb->csum_start = skb_transport_header(skb) - skb->head;
  823. skb->csum_offset = offsetof(struct udphdr, check);
  824. uh->check = ~csum_ipv6_magic(saddr, daddr, len, IPPROTO_UDP, 0);
  825. } else {
  826. /*
  827. * HW-checksum won't work as there are two or more
  828. * fragments on the socket so that all csums of sk_buffs
  829. * should be together
  830. */
  831. offset = skb_transport_offset(skb);
  832. skb->csum = skb_checksum(skb, offset, skb->len - offset, 0);
  833. skb->ip_summed = CHECKSUM_NONE;
  834. skb_queue_walk(&sk->sk_write_queue, skb) {
  835. csum = csum_add(csum, skb->csum);
  836. }
  837. uh->check = csum_ipv6_magic(saddr, daddr, len, IPPROTO_UDP,
  838. csum);
  839. if (uh->check == 0)
  840. uh->check = CSUM_MANGLED_0;
  841. }
  842. }
  843. /*
  844. * Sending
  845. */
  846. static int udp_v6_push_pending_frames(struct sock *sk)
  847. {
  848. struct sk_buff *skb;
  849. struct udphdr *uh;
  850. struct udp_sock *up = udp_sk(sk);
  851. struct inet_sock *inet = inet_sk(sk);
  852. struct flowi6 *fl6;
  853. int err = 0;
  854. int is_udplite = IS_UDPLITE(sk);
  855. __wsum csum = 0;
  856. if (up->pending == AF_INET)
  857. return udp_push_pending_frames(sk);
  858. fl6 = &inet->cork.fl.u.ip6;
  859. /* Grab the skbuff where UDP header space exists. */
  860. if ((skb = skb_peek(&sk->sk_write_queue)) == NULL)
  861. goto out;
  862. /*
  863. * Create a UDP header
  864. */
  865. uh = udp_hdr(skb);
  866. uh->source = fl6->fl6_sport;
  867. uh->dest = fl6->fl6_dport;
  868. uh->len = htons(up->len);
  869. uh->check = 0;
  870. if (is_udplite)
  871. csum = udplite_csum_outgoing(sk, skb);
  872. else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */
  873. udp6_hwcsum_outgoing(sk, skb, &fl6->saddr, &fl6->daddr,
  874. up->len);
  875. goto send;
  876. } else
  877. csum = udp_csum_outgoing(sk, skb);
  878. /* add protocol-dependent pseudo-header */
  879. uh->check = csum_ipv6_magic(&fl6->saddr, &fl6->daddr,
  880. up->len, fl6->flowi6_proto, csum);
  881. if (uh->check == 0)
  882. uh->check = CSUM_MANGLED_0;
  883. send:
  884. err = ip6_push_pending_frames(sk);
  885. if (err) {
  886. if (err == -ENOBUFS && !inet6_sk(sk)->recverr) {
  887. UDP6_INC_STATS_USER(sock_net(sk),
  888. UDP_MIB_SNDBUFERRORS, is_udplite);
  889. err = 0;
  890. }
  891. } else
  892. UDP6_INC_STATS_USER(sock_net(sk),
  893. UDP_MIB_OUTDATAGRAMS, is_udplite);
  894. out:
  895. up->len = 0;
  896. up->pending = 0;
  897. return err;
  898. }
  899. int udpv6_sendmsg(struct kiocb *iocb, struct sock *sk,
  900. struct msghdr *msg, size_t len)
  901. {
  902. struct ipv6_txoptions opt_space;
  903. struct udp_sock *up = udp_sk(sk);
  904. struct inet_sock *inet = inet_sk(sk);
  905. struct ipv6_pinfo *np = inet6_sk(sk);
  906. DECLARE_SOCKADDR(struct sockaddr_in6 *, sin6, msg->msg_name);
  907. struct in6_addr *daddr, *final_p, final;
  908. struct ipv6_txoptions *opt = NULL;
  909. struct ip6_flowlabel *flowlabel = NULL;
  910. struct flowi6 fl6;
  911. struct dst_entry *dst;
  912. int addr_len = msg->msg_namelen;
  913. int ulen = len;
  914. int hlimit = -1;
  915. int tclass = -1;
  916. int dontfrag = -1;
  917. int corkreq = up->corkflag || msg->msg_flags&MSG_MORE;
  918. int err;
  919. int connected = 0;
  920. int is_udplite = IS_UDPLITE(sk);
  921. int (*getfrag)(void *, char *, int, int, int, struct sk_buff *);
  922. /* destination address check */
  923. if (sin6) {
  924. if (addr_len < offsetof(struct sockaddr, sa_data))
  925. return -EINVAL;
  926. switch (sin6->sin6_family) {
  927. case AF_INET6:
  928. if (addr_len < SIN6_LEN_RFC2133)
  929. return -EINVAL;
  930. daddr = &sin6->sin6_addr;
  931. break;
  932. case AF_INET:
  933. goto do_udp_sendmsg;
  934. case AF_UNSPEC:
  935. msg->msg_name = sin6 = NULL;
  936. msg->msg_namelen = addr_len = 0;
  937. daddr = NULL;
  938. break;
  939. default:
  940. return -EINVAL;
  941. }
  942. } else if (!up->pending) {
  943. if (sk->sk_state != TCP_ESTABLISHED)
  944. return -EDESTADDRREQ;
  945. daddr = &sk->sk_v6_daddr;
  946. } else
  947. daddr = NULL;
  948. if (daddr) {
  949. if (ipv6_addr_v4mapped(daddr)) {
  950. struct sockaddr_in sin;
  951. sin.sin_family = AF_INET;
  952. sin.sin_port = sin6 ? sin6->sin6_port : inet->inet_dport;
  953. sin.sin_addr.s_addr = daddr->s6_addr32[3];
  954. msg->msg_name = &sin;
  955. msg->msg_namelen = sizeof(sin);
  956. do_udp_sendmsg:
  957. if (__ipv6_only_sock(sk))
  958. return -ENETUNREACH;
  959. return udp_sendmsg(iocb, sk, msg, len);
  960. }
  961. }
  962. if (up->pending == AF_INET)
  963. return udp_sendmsg(iocb, sk, msg, len);
  964. /* Rough check on arithmetic overflow,
  965. better check is made in ip6_append_data().
  966. */
  967. if (len > INT_MAX - sizeof(struct udphdr))
  968. return -EMSGSIZE;
  969. if (up->pending) {
  970. /*
  971. * There are pending frames.
  972. * The socket lock must be held while it's corked.
  973. */
  974. lock_sock(sk);
  975. if (likely(up->pending)) {
  976. if (unlikely(up->pending != AF_INET6)) {
  977. release_sock(sk);
  978. return -EAFNOSUPPORT;
  979. }
  980. dst = NULL;
  981. goto do_append_data;
  982. }
  983. release_sock(sk);
  984. }
  985. ulen += sizeof(struct udphdr);
  986. memset(&fl6, 0, sizeof(fl6));
  987. if (sin6) {
  988. if (sin6->sin6_port == 0)
  989. return -EINVAL;
  990. fl6.fl6_dport = sin6->sin6_port;
  991. daddr = &sin6->sin6_addr;
  992. if (np->sndflow) {
  993. fl6.flowlabel = sin6->sin6_flowinfo&IPV6_FLOWINFO_MASK;
  994. if (fl6.flowlabel&IPV6_FLOWLABEL_MASK) {
  995. flowlabel = fl6_sock_lookup(sk, fl6.flowlabel);
  996. if (flowlabel == NULL)
  997. return -EINVAL;
  998. }
  999. }
  1000. /*
  1001. * Otherwise it will be difficult to maintain
  1002. * sk->sk_dst_cache.
  1003. */
  1004. if (sk->sk_state == TCP_ESTABLISHED &&
  1005. ipv6_addr_equal(daddr, &sk->sk_v6_daddr))
  1006. daddr = &sk->sk_v6_daddr;
  1007. if (addr_len >= sizeof(struct sockaddr_in6) &&
  1008. sin6->sin6_scope_id &&
  1009. __ipv6_addr_needs_scope_id(__ipv6_addr_type(daddr)))
  1010. fl6.flowi6_oif = sin6->sin6_scope_id;
  1011. } else {
  1012. if (sk->sk_state != TCP_ESTABLISHED)
  1013. return -EDESTADDRREQ;
  1014. fl6.fl6_dport = inet->inet_dport;
  1015. daddr = &sk->sk_v6_daddr;
  1016. fl6.flowlabel = np->flow_label;
  1017. connected = 1;
  1018. }
  1019. if (!fl6.flowi6_oif)
  1020. fl6.flowi6_oif = sk->sk_bound_dev_if;
  1021. if (!fl6.flowi6_oif)
  1022. fl6.flowi6_oif = np->sticky_pktinfo.ipi6_ifindex;
  1023. fl6.flowi6_mark = sk->sk_mark;
  1024. if (msg->msg_controllen) {
  1025. opt = &opt_space;
  1026. memset(opt, 0, sizeof(struct ipv6_txoptions));
  1027. opt->tot_len = sizeof(*opt);
  1028. err = ip6_datagram_send_ctl(sock_net(sk), sk, msg, &fl6, opt,
  1029. &hlimit, &tclass, &dontfrag);
  1030. if (err < 0) {
  1031. fl6_sock_release(flowlabel);
  1032. return err;
  1033. }
  1034. if ((fl6.flowlabel&IPV6_FLOWLABEL_MASK) && !flowlabel) {
  1035. flowlabel = fl6_sock_lookup(sk, fl6.flowlabel);
  1036. if (flowlabel == NULL)
  1037. return -EINVAL;
  1038. }
  1039. if (!(opt->opt_nflen|opt->opt_flen))
  1040. opt = NULL;
  1041. connected = 0;
  1042. }
  1043. if (opt == NULL)
  1044. opt = np->opt;
  1045. if (flowlabel)
  1046. opt = fl6_merge_options(&opt_space, flowlabel, opt);
  1047. opt = ipv6_fixup_options(&opt_space, opt);
  1048. fl6.flowi6_proto = sk->sk_protocol;
  1049. if (!ipv6_addr_any(daddr))
  1050. fl6.daddr = *daddr;
  1051. else
  1052. fl6.daddr.s6_addr[15] = 0x1; /* :: means loopback (BSD'ism) */
  1053. if (ipv6_addr_any(&fl6.saddr) && !ipv6_addr_any(&np->saddr))
  1054. fl6.saddr = np->saddr;
  1055. fl6.fl6_sport = inet->inet_sport;
  1056. final_p = fl6_update_dst(&fl6, opt, &final);
  1057. if (final_p)
  1058. connected = 0;
  1059. if (!fl6.flowi6_oif && ipv6_addr_is_multicast(&fl6.daddr)) {
  1060. fl6.flowi6_oif = np->mcast_oif;
  1061. connected = 0;
  1062. } else if (!fl6.flowi6_oif)
  1063. fl6.flowi6_oif = np->ucast_oif;
  1064. security_sk_classify_flow(sk, flowi6_to_flowi(&fl6));
  1065. dst = ip6_sk_dst_lookup_flow(sk, &fl6, final_p);
  1066. if (IS_ERR(dst)) {
  1067. err = PTR_ERR(dst);
  1068. dst = NULL;
  1069. goto out;
  1070. }
  1071. if (hlimit < 0) {
  1072. if (ipv6_addr_is_multicast(&fl6.daddr))
  1073. hlimit = np->mcast_hops;
  1074. else
  1075. hlimit = np->hop_limit;
  1076. if (hlimit < 0)
  1077. hlimit = ip6_dst_hoplimit(dst);
  1078. }
  1079. if (tclass < 0)
  1080. tclass = np->tclass;
  1081. if (msg->msg_flags&MSG_CONFIRM)
  1082. goto do_confirm;
  1083. back_from_confirm:
  1084. lock_sock(sk);
  1085. if (unlikely(up->pending)) {
  1086. /* The socket is already corked while preparing it. */
  1087. /* ... which is an evident application bug. --ANK */
  1088. release_sock(sk);
  1089. LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 2\n");
  1090. err = -EINVAL;
  1091. goto out;
  1092. }
  1093. up->pending = AF_INET6;
  1094. do_append_data:
  1095. if (dontfrag < 0)
  1096. dontfrag = np->dontfrag;
  1097. up->len += ulen;
  1098. getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag;
  1099. err = ip6_append_data(sk, getfrag, msg->msg_iov, ulen,
  1100. sizeof(struct udphdr), hlimit, tclass, opt, &fl6,
  1101. (struct rt6_info*)dst,
  1102. corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags, dontfrag);
  1103. if (err)
  1104. udp_v6_flush_pending_frames(sk);
  1105. else if (!corkreq)
  1106. err = udp_v6_push_pending_frames(sk);
  1107. else if (unlikely(skb_queue_empty(&sk->sk_write_queue)))
  1108. up->pending = 0;
  1109. if (dst) {
  1110. if (connected) {
  1111. ip6_dst_store(sk, dst,
  1112. ipv6_addr_equal(&fl6.daddr, &sk->sk_v6_daddr) ?
  1113. &sk->sk_v6_daddr : NULL,
  1114. #ifdef CONFIG_IPV6_SUBTREES
  1115. ipv6_addr_equal(&fl6.saddr, &np->saddr) ?
  1116. &np->saddr :
  1117. #endif
  1118. NULL);
  1119. } else {
  1120. dst_release(dst);
  1121. }
  1122. dst = NULL;
  1123. }
  1124. if (err > 0)
  1125. err = np->recverr ? net_xmit_errno(err) : 0;
  1126. release_sock(sk);
  1127. out:
  1128. dst_release(dst);
  1129. fl6_sock_release(flowlabel);
  1130. if (!err)
  1131. return len;
  1132. /*
  1133. * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
  1134. * ENOBUFS might not be good (it's not tunable per se), but otherwise
  1135. * we don't have a good statistic (IpOutDiscards but it can be too many
  1136. * things). We could add another new stat but at least for now that
  1137. * seems like overkill.
  1138. */
  1139. if (err == -ENOBUFS || test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
  1140. UDP6_INC_STATS_USER(sock_net(sk),
  1141. UDP_MIB_SNDBUFERRORS, is_udplite);
  1142. }
  1143. return err;
  1144. do_confirm:
  1145. dst_confirm(dst);
  1146. if (!(msg->msg_flags&MSG_PROBE) || len)
  1147. goto back_from_confirm;
  1148. err = 0;
  1149. goto out;
  1150. }
  1151. void udpv6_destroy_sock(struct sock *sk)
  1152. {
  1153. struct udp_sock *up = udp_sk(sk);
  1154. lock_sock(sk);
  1155. udp_v6_flush_pending_frames(sk);
  1156. release_sock(sk);
  1157. if (static_key_false(&udpv6_encap_needed) && up->encap_type) {
  1158. void (*encap_destroy)(struct sock *sk);
  1159. encap_destroy = ACCESS_ONCE(up->encap_destroy);
  1160. if (encap_destroy)
  1161. encap_destroy(sk);
  1162. }
  1163. inet6_destroy_sock(sk);
  1164. }
  1165. /*
  1166. * Socket option code for UDP
  1167. */
  1168. int udpv6_setsockopt(struct sock *sk, int level, int optname,
  1169. char __user *optval, unsigned int optlen)
  1170. {
  1171. if (level == SOL_UDP || level == SOL_UDPLITE)
  1172. return udp_lib_setsockopt(sk, level, optname, optval, optlen,
  1173. udp_v6_push_pending_frames);
  1174. return ipv6_setsockopt(sk, level, optname, optval, optlen);
  1175. }
  1176. #ifdef CONFIG_COMPAT
  1177. int compat_udpv6_setsockopt(struct sock *sk, int level, int optname,
  1178. char __user *optval, unsigned int optlen)
  1179. {
  1180. if (level == SOL_UDP || level == SOL_UDPLITE)
  1181. return udp_lib_setsockopt(sk, level, optname, optval, optlen,
  1182. udp_v6_push_pending_frames);
  1183. return compat_ipv6_setsockopt(sk, level, optname, optval, optlen);
  1184. }
  1185. #endif
  1186. int udpv6_getsockopt(struct sock *sk, int level, int optname,
  1187. char __user *optval, int __user *optlen)
  1188. {
  1189. if (level == SOL_UDP || level == SOL_UDPLITE)
  1190. return udp_lib_getsockopt(sk, level, optname, optval, optlen);
  1191. return ipv6_getsockopt(sk, level, optname, optval, optlen);
  1192. }
  1193. #ifdef CONFIG_COMPAT
  1194. int compat_udpv6_getsockopt(struct sock *sk, int level, int optname,
  1195. char __user *optval, int __user *optlen)
  1196. {
  1197. if (level == SOL_UDP || level == SOL_UDPLITE)
  1198. return udp_lib_getsockopt(sk, level, optname, optval, optlen);
  1199. return compat_ipv6_getsockopt(sk, level, optname, optval, optlen);
  1200. }
  1201. #endif
  1202. static const struct inet6_protocol udpv6_protocol = {
  1203. .handler = udpv6_rcv,
  1204. .err_handler = udpv6_err,
  1205. .flags = INET6_PROTO_NOPOLICY|INET6_PROTO_FINAL,
  1206. };
  1207. /* ------------------------------------------------------------------------ */
  1208. #ifdef CONFIG_PROC_FS
  1209. int udp6_seq_show(struct seq_file *seq, void *v)
  1210. {
  1211. if (v == SEQ_START_TOKEN) {
  1212. seq_puts(seq, IPV6_SEQ_DGRAM_HEADER);
  1213. } else {
  1214. int bucket = ((struct udp_iter_state *)seq->private)->bucket;
  1215. struct inet_sock *inet = inet_sk(v);
  1216. __u16 srcp = ntohs(inet->inet_sport);
  1217. __u16 destp = ntohs(inet->inet_dport);
  1218. ip6_dgram_sock_seq_show(seq, v, srcp, destp, bucket);
  1219. }
  1220. return 0;
  1221. }
  1222. static const struct file_operations udp6_afinfo_seq_fops = {
  1223. .owner = THIS_MODULE,
  1224. .open = udp_seq_open,
  1225. .read = seq_read,
  1226. .llseek = seq_lseek,
  1227. .release = seq_release_net
  1228. };
  1229. static struct udp_seq_afinfo udp6_seq_afinfo = {
  1230. .name = "udp6",
  1231. .family = AF_INET6,
  1232. .udp_table = &udp_table,
  1233. .seq_fops = &udp6_afinfo_seq_fops,
  1234. .seq_ops = {
  1235. .show = udp6_seq_show,
  1236. },
  1237. };
  1238. int __net_init udp6_proc_init(struct net *net)
  1239. {
  1240. return udp_proc_register(net, &udp6_seq_afinfo);
  1241. }
  1242. void udp6_proc_exit(struct net *net) {
  1243. udp_proc_unregister(net, &udp6_seq_afinfo);
  1244. }
  1245. #endif /* CONFIG_PROC_FS */
  1246. void udp_v6_clear_sk(struct sock *sk, int size)
  1247. {
  1248. struct inet_sock *inet = inet_sk(sk);
  1249. /* we do not want to clear pinet6 field, because of RCU lookups */
  1250. sk_prot_clear_portaddr_nulls(sk, offsetof(struct inet_sock, pinet6));
  1251. size -= offsetof(struct inet_sock, pinet6) + sizeof(inet->pinet6);
  1252. memset(&inet->pinet6 + 1, 0, size);
  1253. }
  1254. /* ------------------------------------------------------------------------ */
  1255. struct proto udpv6_prot = {
  1256. .name = "UDPv6",
  1257. .owner = THIS_MODULE,
  1258. .close = udp_lib_close,
  1259. .connect = ip6_datagram_connect,
  1260. .disconnect = udp_disconnect,
  1261. .ioctl = udp_ioctl,
  1262. .destroy = udpv6_destroy_sock,
  1263. .setsockopt = udpv6_setsockopt,
  1264. .getsockopt = udpv6_getsockopt,
  1265. .sendmsg = udpv6_sendmsg,
  1266. .recvmsg = udpv6_recvmsg,
  1267. .backlog_rcv = __udpv6_queue_rcv_skb,
  1268. .hash = udp_lib_hash,
  1269. .unhash = udp_lib_unhash,
  1270. .rehash = udp_v6_rehash,
  1271. .get_port = udp_v6_get_port,
  1272. .memory_allocated = &udp_memory_allocated,
  1273. .sysctl_mem = sysctl_udp_mem,
  1274. .sysctl_wmem = &sysctl_udp_wmem_min,
  1275. .sysctl_rmem = &sysctl_udp_rmem_min,
  1276. .obj_size = sizeof(struct udp6_sock),
  1277. .slab_flags = SLAB_DESTROY_BY_RCU,
  1278. .h.udp_table = &udp_table,
  1279. #ifdef CONFIG_COMPAT
  1280. .compat_setsockopt = compat_udpv6_setsockopt,
  1281. .compat_getsockopt = compat_udpv6_getsockopt,
  1282. #endif
  1283. .clear_sk = udp_v6_clear_sk,
  1284. };
  1285. static struct inet_protosw udpv6_protosw = {
  1286. .type = SOCK_DGRAM,
  1287. .protocol = IPPROTO_UDP,
  1288. .prot = &udpv6_prot,
  1289. .ops = &inet6_dgram_ops,
  1290. .no_check = UDP_CSUM_DEFAULT,
  1291. .flags = INET_PROTOSW_PERMANENT,
  1292. };
  1293. int __init udpv6_init(void)
  1294. {
  1295. int ret;
  1296. ret = inet6_add_protocol(&udpv6_protocol, IPPROTO_UDP);
  1297. if (ret)
  1298. goto out;
  1299. ret = inet6_register_protosw(&udpv6_protosw);
  1300. if (ret)
  1301. goto out_udpv6_protocol;
  1302. out:
  1303. return ret;
  1304. out_udpv6_protocol:
  1305. inet6_del_protocol(&udpv6_protocol, IPPROTO_UDP);
  1306. goto out;
  1307. }
  1308. void udpv6_exit(void)
  1309. {
  1310. inet6_unregister_protosw(&udpv6_protosw);
  1311. inet6_del_protocol(&udpv6_protocol, IPPROTO_UDP);
  1312. }