udp.c 39 KB

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