udp.c 37 KB

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