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 (addr_len)
  352. *addr_len = sizeof(struct sockaddr_in6);
  353. if (flags & MSG_ERRQUEUE)
  354. return ipv6_recv_error(sk, msg, len);
  355. if (np->rxpmtu && np->rxopt.bits.rxpmtu)
  356. return ipv6_recv_rxpmtu(sk, msg, len);
  357. try_again:
  358. skb = __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0),
  359. &peeked, &off, &err);
  360. if (!skb)
  361. goto out;
  362. ulen = skb->len - sizeof(struct udphdr);
  363. copied = len;
  364. if (copied > ulen)
  365. copied = ulen;
  366. else if (copied < ulen)
  367. msg->msg_flags |= MSG_TRUNC;
  368. is_udp4 = (skb->protocol == htons(ETH_P_IP));
  369. /*
  370. * If checksum is needed at all, try to do it while copying the
  371. * data. If the data is truncated, or if we only want a partial
  372. * coverage checksum (UDP-Lite), do it before the copy.
  373. */
  374. if (copied < ulen || UDP_SKB_CB(skb)->partial_cov) {
  375. if (udp_lib_checksum_complete(skb))
  376. goto csum_copy_err;
  377. }
  378. if (skb_csum_unnecessary(skb))
  379. err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr),
  380. msg->msg_iov, copied);
  381. else {
  382. err = skb_copy_and_csum_datagram_iovec(skb, sizeof(struct udphdr), msg->msg_iov);
  383. if (err == -EINVAL)
  384. goto csum_copy_err;
  385. }
  386. if (unlikely(err)) {
  387. trace_kfree_skb(skb, udpv6_recvmsg);
  388. if (!peeked) {
  389. atomic_inc(&sk->sk_drops);
  390. if (is_udp4)
  391. UDP_INC_STATS_USER(sock_net(sk),
  392. UDP_MIB_INERRORS,
  393. is_udplite);
  394. else
  395. UDP6_INC_STATS_USER(sock_net(sk),
  396. UDP_MIB_INERRORS,
  397. is_udplite);
  398. }
  399. goto out_free;
  400. }
  401. if (!peeked) {
  402. if (is_udp4)
  403. UDP_INC_STATS_USER(sock_net(sk),
  404. UDP_MIB_INDATAGRAMS, is_udplite);
  405. else
  406. UDP6_INC_STATS_USER(sock_net(sk),
  407. UDP_MIB_INDATAGRAMS, is_udplite);
  408. }
  409. sock_recv_ts_and_drops(msg, sk, skb);
  410. /* Copy the address. */
  411. if (msg->msg_name) {
  412. struct sockaddr_in6 *sin6;
  413. sin6 = (struct sockaddr_in6 *) msg->msg_name;
  414. sin6->sin6_family = AF_INET6;
  415. sin6->sin6_port = udp_hdr(skb)->source;
  416. sin6->sin6_flowinfo = 0;
  417. if (is_udp4) {
  418. ipv6_addr_set_v4mapped(ip_hdr(skb)->saddr,
  419. &sin6->sin6_addr);
  420. sin6->sin6_scope_id = 0;
  421. } else {
  422. sin6->sin6_addr = ipv6_hdr(skb)->saddr;
  423. sin6->sin6_scope_id =
  424. ipv6_iface_scope_id(&sin6->sin6_addr,
  425. IP6CB(skb)->iif);
  426. }
  427. }
  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_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. ip6_sk_update_pmtu(skb, sk, info);
  481. if (type == NDISC_REDIRECT) {
  482. ip6_sk_redirect(skb, sk);
  483. goto out;
  484. }
  485. np = inet6_sk(sk);
  486. if (!icmpv6_err_convert(type, code, &err) && !np->recverr)
  487. goto out;
  488. if (sk->sk_state != TCP_ESTABLISHED && !np->recverr)
  489. goto out;
  490. if (np->recverr)
  491. ipv6_icmp_error(sk, skb, err, uh->dest, ntohl(info), (u8 *)(uh+1));
  492. sk->sk_err = err;
  493. sk->sk_error_report(sk);
  494. out:
  495. sock_put(sk);
  496. }
  497. static int __udpv6_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
  498. {
  499. int rc;
  500. if (!ipv6_addr_any(&sk->sk_v6_daddr)) {
  501. sock_rps_save_rxhash(sk, skb);
  502. sk_mark_napi_id(sk, skb);
  503. }
  504. rc = sock_queue_rcv_skb(sk, skb);
  505. if (rc < 0) {
  506. int is_udplite = IS_UDPLITE(sk);
  507. /* Note that an ENOMEM error is charged twice */
  508. if (rc == -ENOMEM)
  509. UDP6_INC_STATS_BH(sock_net(sk),
  510. UDP_MIB_RCVBUFERRORS, is_udplite);
  511. UDP6_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
  512. kfree_skb(skb);
  513. return -1;
  514. }
  515. return 0;
  516. }
  517. static __inline__ void udpv6_err(struct sk_buff *skb,
  518. struct inet6_skb_parm *opt, u8 type,
  519. u8 code, int offset, __be32 info )
  520. {
  521. __udp6_lib_err(skb, opt, type, code, offset, info, &udp_table);
  522. }
  523. static struct static_key udpv6_encap_needed __read_mostly;
  524. void udpv6_encap_enable(void)
  525. {
  526. if (!static_key_enabled(&udpv6_encap_needed))
  527. static_key_slow_inc(&udpv6_encap_needed);
  528. }
  529. EXPORT_SYMBOL(udpv6_encap_enable);
  530. int udpv6_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
  531. {
  532. struct udp_sock *up = udp_sk(sk);
  533. int rc;
  534. int is_udplite = IS_UDPLITE(sk);
  535. if (!xfrm6_policy_check(sk, XFRM_POLICY_IN, skb))
  536. goto drop;
  537. if (static_key_false(&udpv6_encap_needed) && up->encap_type) {
  538. int (*encap_rcv)(struct sock *sk, struct sk_buff *skb);
  539. /*
  540. * This is an encapsulation socket so pass the skb to
  541. * the socket's udp_encap_rcv() hook. Otherwise, just
  542. * fall through and pass this up the UDP socket.
  543. * up->encap_rcv() returns the following value:
  544. * =0 if skb was successfully passed to the encap
  545. * handler or was discarded by it.
  546. * >0 if skb should be passed on to UDP.
  547. * <0 if skb should be resubmitted as proto -N
  548. */
  549. /* if we're overly short, let UDP handle it */
  550. encap_rcv = ACCESS_ONCE(up->encap_rcv);
  551. if (skb->len > sizeof(struct udphdr) && encap_rcv != NULL) {
  552. int ret;
  553. ret = encap_rcv(sk, skb);
  554. if (ret <= 0) {
  555. UDP_INC_STATS_BH(sock_net(sk),
  556. UDP_MIB_INDATAGRAMS,
  557. is_udplite);
  558. return -ret;
  559. }
  560. }
  561. /* FALLTHROUGH -- it's a UDP Packet */
  562. }
  563. /*
  564. * UDP-Lite specific tests, ignored on UDP sockets (see net/ipv4/udp.c).
  565. */
  566. if ((is_udplite & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) {
  567. if (up->pcrlen == 0) { /* full coverage was set */
  568. LIMIT_NETDEBUG(KERN_WARNING "UDPLITE6: partial coverage"
  569. " %d while full coverage %d requested\n",
  570. UDP_SKB_CB(skb)->cscov, skb->len);
  571. goto drop;
  572. }
  573. if (UDP_SKB_CB(skb)->cscov < up->pcrlen) {
  574. LIMIT_NETDEBUG(KERN_WARNING "UDPLITE6: coverage %d "
  575. "too small, need min %d\n",
  576. UDP_SKB_CB(skb)->cscov, up->pcrlen);
  577. goto drop;
  578. }
  579. }
  580. if (rcu_access_pointer(sk->sk_filter)) {
  581. if (udp_lib_checksum_complete(skb))
  582. goto csum_error;
  583. }
  584. if (sk_rcvqueues_full(sk, skb, sk->sk_rcvbuf))
  585. goto drop;
  586. skb_dst_drop(skb);
  587. bh_lock_sock(sk);
  588. rc = 0;
  589. if (!sock_owned_by_user(sk))
  590. rc = __udpv6_queue_rcv_skb(sk, skb);
  591. else if (sk_add_backlog(sk, skb, sk->sk_rcvbuf)) {
  592. bh_unlock_sock(sk);
  593. goto drop;
  594. }
  595. bh_unlock_sock(sk);
  596. return rc;
  597. csum_error:
  598. UDP6_INC_STATS_BH(sock_net(sk), UDP_MIB_CSUMERRORS, is_udplite);
  599. drop:
  600. UDP6_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
  601. atomic_inc(&sk->sk_drops);
  602. kfree_skb(skb);
  603. return -1;
  604. }
  605. static struct sock *udp_v6_mcast_next(struct net *net, struct sock *sk,
  606. __be16 loc_port, const struct in6_addr *loc_addr,
  607. __be16 rmt_port, const struct in6_addr *rmt_addr,
  608. int dif)
  609. {
  610. struct hlist_nulls_node *node;
  611. struct sock *s = sk;
  612. unsigned short num = ntohs(loc_port);
  613. sk_nulls_for_each_from(s, node) {
  614. struct inet_sock *inet = inet_sk(s);
  615. if (!net_eq(sock_net(s), net))
  616. continue;
  617. if (udp_sk(s)->udp_port_hash == num &&
  618. s->sk_family == PF_INET6) {
  619. if (inet->inet_dport) {
  620. if (inet->inet_dport != rmt_port)
  621. continue;
  622. }
  623. if (!ipv6_addr_any(&sk->sk_v6_daddr) &&
  624. !ipv6_addr_equal(&sk->sk_v6_daddr, rmt_addr))
  625. continue;
  626. if (s->sk_bound_dev_if && s->sk_bound_dev_if != dif)
  627. continue;
  628. if (!ipv6_addr_any(&sk->sk_v6_rcv_saddr)) {
  629. if (!ipv6_addr_equal(&sk->sk_v6_rcv_saddr, loc_addr))
  630. continue;
  631. }
  632. if (!inet6_mc_check(s, loc_addr, rmt_addr))
  633. continue;
  634. return s;
  635. }
  636. }
  637. return NULL;
  638. }
  639. static void flush_stack(struct sock **stack, unsigned int count,
  640. struct sk_buff *skb, unsigned int final)
  641. {
  642. struct sk_buff *skb1 = NULL;
  643. struct sock *sk;
  644. unsigned int i;
  645. for (i = 0; i < count; i++) {
  646. sk = stack[i];
  647. if (likely(skb1 == NULL))
  648. skb1 = (i == final) ? skb : skb_clone(skb, GFP_ATOMIC);
  649. if (!skb1) {
  650. atomic_inc(&sk->sk_drops);
  651. UDP6_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
  652. IS_UDPLITE(sk));
  653. UDP6_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS,
  654. IS_UDPLITE(sk));
  655. }
  656. if (skb1 && udpv6_queue_rcv_skb(sk, skb1) <= 0)
  657. skb1 = NULL;
  658. }
  659. if (unlikely(skb1))
  660. kfree_skb(skb1);
  661. }
  662. /*
  663. * Note: called only from the BH handler context,
  664. * so we don't need to lock the hashes.
  665. */
  666. static int __udp6_lib_mcast_deliver(struct net *net, struct sk_buff *skb,
  667. const struct in6_addr *saddr, const struct in6_addr *daddr,
  668. struct udp_table *udptable)
  669. {
  670. struct sock *sk, *stack[256 / sizeof(struct sock *)];
  671. const struct udphdr *uh = udp_hdr(skb);
  672. struct udp_hslot *hslot = udp_hashslot(udptable, net, ntohs(uh->dest));
  673. int dif;
  674. unsigned int i, count = 0;
  675. spin_lock(&hslot->lock);
  676. sk = sk_nulls_head(&hslot->head);
  677. dif = inet6_iif(skb);
  678. sk = udp_v6_mcast_next(net, sk, uh->dest, daddr, uh->source, saddr, dif);
  679. while (sk) {
  680. stack[count++] = sk;
  681. sk = udp_v6_mcast_next(net, sk_nulls_next(sk), uh->dest, daddr,
  682. uh->source, saddr, dif);
  683. if (unlikely(count == ARRAY_SIZE(stack))) {
  684. if (!sk)
  685. break;
  686. flush_stack(stack, count, skb, ~0);
  687. count = 0;
  688. }
  689. }
  690. /*
  691. * before releasing the lock, we must take reference on sockets
  692. */
  693. for (i = 0; i < count; i++)
  694. sock_hold(stack[i]);
  695. spin_unlock(&hslot->lock);
  696. if (count) {
  697. flush_stack(stack, count, skb, count - 1);
  698. for (i = 0; i < count; i++)
  699. sock_put(stack[i]);
  700. } else {
  701. kfree_skb(skb);
  702. }
  703. return 0;
  704. }
  705. int __udp6_lib_rcv(struct sk_buff *skb, struct udp_table *udptable,
  706. int proto)
  707. {
  708. struct net *net = dev_net(skb->dev);
  709. struct sock *sk;
  710. struct udphdr *uh;
  711. const struct in6_addr *saddr, *daddr;
  712. u32 ulen = 0;
  713. if (!pskb_may_pull(skb, sizeof(struct udphdr)))
  714. goto discard;
  715. saddr = &ipv6_hdr(skb)->saddr;
  716. daddr = &ipv6_hdr(skb)->daddr;
  717. uh = udp_hdr(skb);
  718. ulen = ntohs(uh->len);
  719. if (ulen > skb->len)
  720. goto short_packet;
  721. if (proto == IPPROTO_UDP) {
  722. /* UDP validates ulen. */
  723. /* Check for jumbo payload */
  724. if (ulen == 0)
  725. ulen = skb->len;
  726. if (ulen < sizeof(*uh))
  727. goto short_packet;
  728. if (ulen < skb->len) {
  729. if (pskb_trim_rcsum(skb, ulen))
  730. goto short_packet;
  731. saddr = &ipv6_hdr(skb)->saddr;
  732. daddr = &ipv6_hdr(skb)->daddr;
  733. uh = udp_hdr(skb);
  734. }
  735. }
  736. if (udp6_csum_init(skb, uh, proto))
  737. goto csum_error;
  738. /*
  739. * Multicast receive code
  740. */
  741. if (ipv6_addr_is_multicast(daddr))
  742. return __udp6_lib_mcast_deliver(net, skb,
  743. saddr, daddr, udptable);
  744. /* Unicast */
  745. /*
  746. * check socket cache ... must talk to Alan about his plans
  747. * for sock caches... i'll skip this for now.
  748. */
  749. sk = __udp6_lib_lookup_skb(skb, uh->source, uh->dest, udptable);
  750. if (sk != NULL) {
  751. int ret;
  752. ret = udpv6_queue_rcv_skb(sk, skb);
  753. sock_put(sk);
  754. /* a return value > 0 means to resubmit the input, but
  755. * it wants the return to be -protocol, or 0
  756. */
  757. if (ret > 0)
  758. return -ret;
  759. return 0;
  760. }
  761. if (!xfrm6_policy_check(NULL, XFRM_POLICY_IN, skb))
  762. goto discard;
  763. if (udp_lib_checksum_complete(skb))
  764. goto csum_error;
  765. UDP6_INC_STATS_BH(net, UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE);
  766. icmpv6_send(skb, ICMPV6_DEST_UNREACH, ICMPV6_PORT_UNREACH, 0);
  767. kfree_skb(skb);
  768. return 0;
  769. short_packet:
  770. LIMIT_NETDEBUG(KERN_DEBUG "UDP%sv6: short packet: From [%pI6c]:%u %d/%d to [%pI6c]:%u\n",
  771. proto == IPPROTO_UDPLITE ? "-Lite" : "",
  772. saddr,
  773. ntohs(uh->source),
  774. ulen,
  775. skb->len,
  776. daddr,
  777. ntohs(uh->dest));
  778. goto discard;
  779. csum_error:
  780. UDP6_INC_STATS_BH(net, UDP_MIB_CSUMERRORS, proto == IPPROTO_UDPLITE);
  781. discard:
  782. UDP6_INC_STATS_BH(net, UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE);
  783. kfree_skb(skb);
  784. return 0;
  785. }
  786. static __inline__ int udpv6_rcv(struct sk_buff *skb)
  787. {
  788. return __udp6_lib_rcv(skb, &udp_table, IPPROTO_UDP);
  789. }
  790. /*
  791. * Throw away all pending data and cancel the corking. Socket is locked.
  792. */
  793. static void udp_v6_flush_pending_frames(struct sock *sk)
  794. {
  795. struct udp_sock *up = udp_sk(sk);
  796. if (up->pending == AF_INET)
  797. udp_flush_pending_frames(sk);
  798. else if (up->pending) {
  799. up->len = 0;
  800. up->pending = 0;
  801. ip6_flush_pending_frames(sk);
  802. }
  803. }
  804. /**
  805. * udp6_hwcsum_outgoing - handle outgoing HW checksumming
  806. * @sk: socket we are sending on
  807. * @skb: sk_buff containing the filled-in UDP header
  808. * (checksum field must be zeroed out)
  809. */
  810. static void udp6_hwcsum_outgoing(struct sock *sk, struct sk_buff *skb,
  811. const struct in6_addr *saddr,
  812. const struct in6_addr *daddr, int len)
  813. {
  814. unsigned int offset;
  815. struct udphdr *uh = udp_hdr(skb);
  816. __wsum csum = 0;
  817. if (skb_queue_len(&sk->sk_write_queue) == 1) {
  818. /* Only one fragment on the socket. */
  819. skb->csum_start = skb_transport_header(skb) - skb->head;
  820. skb->csum_offset = offsetof(struct udphdr, check);
  821. uh->check = ~csum_ipv6_magic(saddr, daddr, len, IPPROTO_UDP, 0);
  822. } else {
  823. /*
  824. * HW-checksum won't work as there are two or more
  825. * fragments on the socket so that all csums of sk_buffs
  826. * should be together
  827. */
  828. offset = skb_transport_offset(skb);
  829. skb->csum = skb_checksum(skb, offset, skb->len - offset, 0);
  830. skb->ip_summed = CHECKSUM_NONE;
  831. skb_queue_walk(&sk->sk_write_queue, skb) {
  832. csum = csum_add(csum, skb->csum);
  833. }
  834. uh->check = csum_ipv6_magic(saddr, daddr, len, IPPROTO_UDP,
  835. csum);
  836. if (uh->check == 0)
  837. uh->check = CSUM_MANGLED_0;
  838. }
  839. }
  840. /*
  841. * Sending
  842. */
  843. static int udp_v6_push_pending_frames(struct sock *sk)
  844. {
  845. struct sk_buff *skb;
  846. struct udphdr *uh;
  847. struct udp_sock *up = udp_sk(sk);
  848. struct inet_sock *inet = inet_sk(sk);
  849. struct flowi6 *fl6;
  850. int err = 0;
  851. int is_udplite = IS_UDPLITE(sk);
  852. __wsum csum = 0;
  853. if (up->pending == AF_INET)
  854. return udp_push_pending_frames(sk);
  855. fl6 = &inet->cork.fl.u.ip6;
  856. /* Grab the skbuff where UDP header space exists. */
  857. if ((skb = skb_peek(&sk->sk_write_queue)) == NULL)
  858. goto out;
  859. /*
  860. * Create a UDP header
  861. */
  862. uh = udp_hdr(skb);
  863. uh->source = fl6->fl6_sport;
  864. uh->dest = fl6->fl6_dport;
  865. uh->len = htons(up->len);
  866. uh->check = 0;
  867. if (is_udplite)
  868. csum = udplite_csum_outgoing(sk, skb);
  869. else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */
  870. udp6_hwcsum_outgoing(sk, skb, &fl6->saddr, &fl6->daddr,
  871. up->len);
  872. goto send;
  873. } else
  874. csum = udp_csum_outgoing(sk, skb);
  875. /* add protocol-dependent pseudo-header */
  876. uh->check = csum_ipv6_magic(&fl6->saddr, &fl6->daddr,
  877. up->len, fl6->flowi6_proto, csum);
  878. if (uh->check == 0)
  879. uh->check = CSUM_MANGLED_0;
  880. send:
  881. err = ip6_push_pending_frames(sk);
  882. if (err) {
  883. if (err == -ENOBUFS && !inet6_sk(sk)->recverr) {
  884. UDP6_INC_STATS_USER(sock_net(sk),
  885. UDP_MIB_SNDBUFERRORS, is_udplite);
  886. err = 0;
  887. }
  888. } else
  889. UDP6_INC_STATS_USER(sock_net(sk),
  890. UDP_MIB_OUTDATAGRAMS, is_udplite);
  891. out:
  892. up->len = 0;
  893. up->pending = 0;
  894. return err;
  895. }
  896. int udpv6_sendmsg(struct kiocb *iocb, struct sock *sk,
  897. struct msghdr *msg, size_t len)
  898. {
  899. struct ipv6_txoptions opt_space;
  900. struct udp_sock *up = udp_sk(sk);
  901. struct inet_sock *inet = inet_sk(sk);
  902. struct ipv6_pinfo *np = inet6_sk(sk);
  903. struct sockaddr_in6 *sin6 = (struct sockaddr_in6 *) msg->msg_name;
  904. struct in6_addr *daddr, *final_p, final;
  905. struct ipv6_txoptions *opt = NULL;
  906. struct ip6_flowlabel *flowlabel = NULL;
  907. struct flowi6 fl6;
  908. struct dst_entry *dst;
  909. int addr_len = msg->msg_namelen;
  910. int ulen = len;
  911. int hlimit = -1;
  912. int tclass = -1;
  913. int dontfrag = -1;
  914. int corkreq = up->corkflag || msg->msg_flags&MSG_MORE;
  915. int err;
  916. int connected = 0;
  917. int is_udplite = IS_UDPLITE(sk);
  918. int (*getfrag)(void *, char *, int, int, int, struct sk_buff *);
  919. /* destination address check */
  920. if (sin6) {
  921. if (addr_len < offsetof(struct sockaddr, sa_data))
  922. return -EINVAL;
  923. switch (sin6->sin6_family) {
  924. case AF_INET6:
  925. if (addr_len < SIN6_LEN_RFC2133)
  926. return -EINVAL;
  927. daddr = &sin6->sin6_addr;
  928. break;
  929. case AF_INET:
  930. goto do_udp_sendmsg;
  931. case AF_UNSPEC:
  932. msg->msg_name = sin6 = NULL;
  933. msg->msg_namelen = addr_len = 0;
  934. daddr = NULL;
  935. break;
  936. default:
  937. return -EINVAL;
  938. }
  939. } else if (!up->pending) {
  940. if (sk->sk_state != TCP_ESTABLISHED)
  941. return -EDESTADDRREQ;
  942. daddr = &sk->sk_v6_daddr;
  943. } else
  944. daddr = NULL;
  945. if (daddr) {
  946. if (ipv6_addr_v4mapped(daddr)) {
  947. struct sockaddr_in sin;
  948. sin.sin_family = AF_INET;
  949. sin.sin_port = sin6 ? sin6->sin6_port : inet->inet_dport;
  950. sin.sin_addr.s_addr = daddr->s6_addr32[3];
  951. msg->msg_name = &sin;
  952. msg->msg_namelen = sizeof(sin);
  953. do_udp_sendmsg:
  954. if (__ipv6_only_sock(sk))
  955. return -ENETUNREACH;
  956. return udp_sendmsg(iocb, sk, msg, len);
  957. }
  958. }
  959. if (up->pending == AF_INET)
  960. return udp_sendmsg(iocb, sk, msg, len);
  961. /* Rough check on arithmetic overflow,
  962. better check is made in ip6_append_data().
  963. */
  964. if (len > INT_MAX - sizeof(struct udphdr))
  965. return -EMSGSIZE;
  966. if (up->pending) {
  967. /*
  968. * There are pending frames.
  969. * The socket lock must be held while it's corked.
  970. */
  971. lock_sock(sk);
  972. if (likely(up->pending)) {
  973. if (unlikely(up->pending != AF_INET6)) {
  974. release_sock(sk);
  975. return -EAFNOSUPPORT;
  976. }
  977. dst = NULL;
  978. goto do_append_data;
  979. }
  980. release_sock(sk);
  981. }
  982. ulen += sizeof(struct udphdr);
  983. memset(&fl6, 0, sizeof(fl6));
  984. if (sin6) {
  985. if (sin6->sin6_port == 0)
  986. return -EINVAL;
  987. fl6.fl6_dport = sin6->sin6_port;
  988. daddr = &sin6->sin6_addr;
  989. if (np->sndflow) {
  990. fl6.flowlabel = sin6->sin6_flowinfo&IPV6_FLOWINFO_MASK;
  991. if (fl6.flowlabel&IPV6_FLOWLABEL_MASK) {
  992. flowlabel = fl6_sock_lookup(sk, fl6.flowlabel);
  993. if (flowlabel == NULL)
  994. return -EINVAL;
  995. daddr = &flowlabel->dst;
  996. }
  997. }
  998. /*
  999. * Otherwise it will be difficult to maintain
  1000. * sk->sk_dst_cache.
  1001. */
  1002. if (sk->sk_state == TCP_ESTABLISHED &&
  1003. ipv6_addr_equal(daddr, &sk->sk_v6_daddr))
  1004. daddr = &sk->sk_v6_daddr;
  1005. if (addr_len >= sizeof(struct sockaddr_in6) &&
  1006. sin6->sin6_scope_id &&
  1007. __ipv6_addr_needs_scope_id(__ipv6_addr_type(daddr)))
  1008. fl6.flowi6_oif = sin6->sin6_scope_id;
  1009. } else {
  1010. if (sk->sk_state != TCP_ESTABLISHED)
  1011. return -EDESTADDRREQ;
  1012. fl6.fl6_dport = inet->inet_dport;
  1013. daddr = &sk->sk_v6_daddr;
  1014. fl6.flowlabel = np->flow_label;
  1015. connected = 1;
  1016. }
  1017. if (!fl6.flowi6_oif)
  1018. fl6.flowi6_oif = sk->sk_bound_dev_if;
  1019. if (!fl6.flowi6_oif)
  1020. fl6.flowi6_oif = np->sticky_pktinfo.ipi6_ifindex;
  1021. fl6.flowi6_mark = sk->sk_mark;
  1022. if (msg->msg_controllen) {
  1023. opt = &opt_space;
  1024. memset(opt, 0, sizeof(struct ipv6_txoptions));
  1025. opt->tot_len = sizeof(*opt);
  1026. err = ip6_datagram_send_ctl(sock_net(sk), sk, msg, &fl6, opt,
  1027. &hlimit, &tclass, &dontfrag);
  1028. if (err < 0) {
  1029. fl6_sock_release(flowlabel);
  1030. return err;
  1031. }
  1032. if ((fl6.flowlabel&IPV6_FLOWLABEL_MASK) && !flowlabel) {
  1033. flowlabel = fl6_sock_lookup(sk, fl6.flowlabel);
  1034. if (flowlabel == NULL)
  1035. return -EINVAL;
  1036. }
  1037. if (!(opt->opt_nflen|opt->opt_flen))
  1038. opt = NULL;
  1039. connected = 0;
  1040. }
  1041. if (opt == NULL)
  1042. opt = np->opt;
  1043. if (flowlabel)
  1044. opt = fl6_merge_options(&opt_space, flowlabel, opt);
  1045. opt = ipv6_fixup_options(&opt_space, opt);
  1046. fl6.flowi6_proto = sk->sk_protocol;
  1047. if (!ipv6_addr_any(daddr))
  1048. fl6.daddr = *daddr;
  1049. else
  1050. fl6.daddr.s6_addr[15] = 0x1; /* :: means loopback (BSD'ism) */
  1051. if (ipv6_addr_any(&fl6.saddr) && !ipv6_addr_any(&np->saddr))
  1052. fl6.saddr = np->saddr;
  1053. fl6.fl6_sport = inet->inet_sport;
  1054. final_p = fl6_update_dst(&fl6, opt, &final);
  1055. if (final_p)
  1056. connected = 0;
  1057. if (!fl6.flowi6_oif && ipv6_addr_is_multicast(&fl6.daddr)) {
  1058. fl6.flowi6_oif = np->mcast_oif;
  1059. connected = 0;
  1060. } else if (!fl6.flowi6_oif)
  1061. fl6.flowi6_oif = np->ucast_oif;
  1062. security_sk_classify_flow(sk, flowi6_to_flowi(&fl6));
  1063. dst = ip6_sk_dst_lookup_flow(sk, &fl6, final_p, true);
  1064. if (IS_ERR(dst)) {
  1065. err = PTR_ERR(dst);
  1066. dst = NULL;
  1067. goto out;
  1068. }
  1069. if (hlimit < 0) {
  1070. if (ipv6_addr_is_multicast(&fl6.daddr))
  1071. hlimit = np->mcast_hops;
  1072. else
  1073. hlimit = np->hop_limit;
  1074. if (hlimit < 0)
  1075. hlimit = ip6_dst_hoplimit(dst);
  1076. }
  1077. if (tclass < 0)
  1078. tclass = np->tclass;
  1079. if (dontfrag < 0)
  1080. dontfrag = np->dontfrag;
  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. up->len += ulen;
  1096. getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag;
  1097. err = ip6_append_data(sk, getfrag, msg->msg_iov, ulen,
  1098. sizeof(struct udphdr), hlimit, tclass, opt, &fl6,
  1099. (struct rt6_info*)dst,
  1100. corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags, dontfrag);
  1101. if (err)
  1102. udp_v6_flush_pending_frames(sk);
  1103. else if (!corkreq)
  1104. err = udp_v6_push_pending_frames(sk);
  1105. else if (unlikely(skb_queue_empty(&sk->sk_write_queue)))
  1106. up->pending = 0;
  1107. if (dst) {
  1108. if (connected) {
  1109. ip6_dst_store(sk, dst,
  1110. ipv6_addr_equal(&fl6.daddr, &sk->sk_v6_daddr) ?
  1111. &sk->sk_v6_daddr : NULL,
  1112. #ifdef CONFIG_IPV6_SUBTREES
  1113. ipv6_addr_equal(&fl6.saddr, &np->saddr) ?
  1114. &np->saddr :
  1115. #endif
  1116. NULL);
  1117. } else {
  1118. dst_release(dst);
  1119. }
  1120. dst = NULL;
  1121. }
  1122. if (err > 0)
  1123. err = np->recverr ? net_xmit_errno(err) : 0;
  1124. release_sock(sk);
  1125. out:
  1126. dst_release(dst);
  1127. fl6_sock_release(flowlabel);
  1128. if (!err)
  1129. return len;
  1130. /*
  1131. * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
  1132. * ENOBUFS might not be good (it's not tunable per se), but otherwise
  1133. * we don't have a good statistic (IpOutDiscards but it can be too many
  1134. * things). We could add another new stat but at least for now that
  1135. * seems like overkill.
  1136. */
  1137. if (err == -ENOBUFS || test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
  1138. UDP6_INC_STATS_USER(sock_net(sk),
  1139. UDP_MIB_SNDBUFERRORS, is_udplite);
  1140. }
  1141. return err;
  1142. do_confirm:
  1143. dst_confirm(dst);
  1144. if (!(msg->msg_flags&MSG_PROBE) || len)
  1145. goto back_from_confirm;
  1146. err = 0;
  1147. goto out;
  1148. }
  1149. void udpv6_destroy_sock(struct sock *sk)
  1150. {
  1151. struct udp_sock *up = udp_sk(sk);
  1152. lock_sock(sk);
  1153. udp_v6_flush_pending_frames(sk);
  1154. release_sock(sk);
  1155. if (static_key_false(&udpv6_encap_needed) && up->encap_type) {
  1156. void (*encap_destroy)(struct sock *sk);
  1157. encap_destroy = ACCESS_ONCE(up->encap_destroy);
  1158. if (encap_destroy)
  1159. encap_destroy(sk);
  1160. }
  1161. inet6_destroy_sock(sk);
  1162. }
  1163. /*
  1164. * Socket option code for UDP
  1165. */
  1166. int udpv6_setsockopt(struct sock *sk, int level, int optname,
  1167. char __user *optval, unsigned int optlen)
  1168. {
  1169. if (level == SOL_UDP || level == SOL_UDPLITE)
  1170. return udp_lib_setsockopt(sk, level, optname, optval, optlen,
  1171. udp_v6_push_pending_frames);
  1172. return ipv6_setsockopt(sk, level, optname, optval, optlen);
  1173. }
  1174. #ifdef CONFIG_COMPAT
  1175. int compat_udpv6_setsockopt(struct sock *sk, int level, int optname,
  1176. char __user *optval, unsigned int optlen)
  1177. {
  1178. if (level == SOL_UDP || level == SOL_UDPLITE)
  1179. return udp_lib_setsockopt(sk, level, optname, optval, optlen,
  1180. udp_v6_push_pending_frames);
  1181. return compat_ipv6_setsockopt(sk, level, optname, optval, optlen);
  1182. }
  1183. #endif
  1184. int udpv6_getsockopt(struct sock *sk, int level, int optname,
  1185. char __user *optval, int __user *optlen)
  1186. {
  1187. if (level == SOL_UDP || level == SOL_UDPLITE)
  1188. return udp_lib_getsockopt(sk, level, optname, optval, optlen);
  1189. return ipv6_getsockopt(sk, level, optname, optval, optlen);
  1190. }
  1191. #ifdef CONFIG_COMPAT
  1192. int compat_udpv6_getsockopt(struct sock *sk, int level, int optname,
  1193. char __user *optval, int __user *optlen)
  1194. {
  1195. if (level == SOL_UDP || level == SOL_UDPLITE)
  1196. return udp_lib_getsockopt(sk, level, optname, optval, optlen);
  1197. return compat_ipv6_getsockopt(sk, level, optname, optval, optlen);
  1198. }
  1199. #endif
  1200. static const struct inet6_protocol udpv6_protocol = {
  1201. .handler = udpv6_rcv,
  1202. .err_handler = udpv6_err,
  1203. .flags = INET6_PROTO_NOPOLICY|INET6_PROTO_FINAL,
  1204. };
  1205. /* ------------------------------------------------------------------------ */
  1206. #ifdef CONFIG_PROC_FS
  1207. int udp6_seq_show(struct seq_file *seq, void *v)
  1208. {
  1209. if (v == SEQ_START_TOKEN) {
  1210. seq_puts(seq, IPV6_SEQ_DGRAM_HEADER);
  1211. } else {
  1212. int bucket = ((struct udp_iter_state *)seq->private)->bucket;
  1213. struct inet_sock *inet = inet_sk(v);
  1214. __u16 srcp = ntohs(inet->inet_sport);
  1215. __u16 destp = ntohs(inet->inet_dport);
  1216. ip6_dgram_sock_seq_show(seq, v, srcp, destp, bucket);
  1217. }
  1218. return 0;
  1219. }
  1220. static const struct file_operations udp6_afinfo_seq_fops = {
  1221. .owner = THIS_MODULE,
  1222. .open = udp_seq_open,
  1223. .read = seq_read,
  1224. .llseek = seq_lseek,
  1225. .release = seq_release_net
  1226. };
  1227. static struct udp_seq_afinfo udp6_seq_afinfo = {
  1228. .name = "udp6",
  1229. .family = AF_INET6,
  1230. .udp_table = &udp_table,
  1231. .seq_fops = &udp6_afinfo_seq_fops,
  1232. .seq_ops = {
  1233. .show = udp6_seq_show,
  1234. },
  1235. };
  1236. int __net_init udp6_proc_init(struct net *net)
  1237. {
  1238. return udp_proc_register(net, &udp6_seq_afinfo);
  1239. }
  1240. void udp6_proc_exit(struct net *net) {
  1241. udp_proc_unregister(net, &udp6_seq_afinfo);
  1242. }
  1243. #endif /* CONFIG_PROC_FS */
  1244. void udp_v6_clear_sk(struct sock *sk, int size)
  1245. {
  1246. struct inet_sock *inet = inet_sk(sk);
  1247. /* we do not want to clear pinet6 field, because of RCU lookups */
  1248. sk_prot_clear_portaddr_nulls(sk, offsetof(struct inet_sock, pinet6));
  1249. size -= offsetof(struct inet_sock, pinet6) + sizeof(inet->pinet6);
  1250. memset(&inet->pinet6 + 1, 0, size);
  1251. }
  1252. /* ------------------------------------------------------------------------ */
  1253. struct proto udpv6_prot = {
  1254. .name = "UDPv6",
  1255. .owner = THIS_MODULE,
  1256. .close = udp_lib_close,
  1257. .connect = ip6_datagram_connect,
  1258. .disconnect = udp_disconnect,
  1259. .ioctl = udp_ioctl,
  1260. .destroy = udpv6_destroy_sock,
  1261. .setsockopt = udpv6_setsockopt,
  1262. .getsockopt = udpv6_getsockopt,
  1263. .sendmsg = udpv6_sendmsg,
  1264. .recvmsg = udpv6_recvmsg,
  1265. .backlog_rcv = __udpv6_queue_rcv_skb,
  1266. .hash = udp_lib_hash,
  1267. .unhash = udp_lib_unhash,
  1268. .rehash = udp_v6_rehash,
  1269. .get_port = udp_v6_get_port,
  1270. .memory_allocated = &udp_memory_allocated,
  1271. .sysctl_mem = sysctl_udp_mem,
  1272. .sysctl_wmem = &sysctl_udp_wmem_min,
  1273. .sysctl_rmem = &sysctl_udp_rmem_min,
  1274. .obj_size = sizeof(struct udp6_sock),
  1275. .slab_flags = SLAB_DESTROY_BY_RCU,
  1276. .h.udp_table = &udp_table,
  1277. #ifdef CONFIG_COMPAT
  1278. .compat_setsockopt = compat_udpv6_setsockopt,
  1279. .compat_getsockopt = compat_udpv6_getsockopt,
  1280. #endif
  1281. .clear_sk = udp_v6_clear_sk,
  1282. };
  1283. static struct inet_protosw udpv6_protosw = {
  1284. .type = SOCK_DGRAM,
  1285. .protocol = IPPROTO_UDP,
  1286. .prot = &udpv6_prot,
  1287. .ops = &inet6_dgram_ops,
  1288. .no_check = UDP_CSUM_DEFAULT,
  1289. .flags = INET_PROTOSW_PERMANENT,
  1290. };
  1291. int __init udpv6_init(void)
  1292. {
  1293. int ret;
  1294. ret = inet6_add_protocol(&udpv6_protocol, IPPROTO_UDP);
  1295. if (ret)
  1296. goto out;
  1297. ret = inet6_register_protosw(&udpv6_protosw);
  1298. if (ret)
  1299. goto out_udpv6_protocol;
  1300. out:
  1301. return ret;
  1302. out_udpv6_protocol:
  1303. inet6_del_protocol(&udpv6_protocol, IPPROTO_UDP);
  1304. goto out;
  1305. }
  1306. void udpv6_exit(void)
  1307. {
  1308. inet6_unregister_protosw(&udpv6_protosw);
  1309. inet6_del_protocol(&udpv6_protocol, IPPROTO_UDP);
  1310. }