udp.c 37 KB

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