udp.c 38 KB

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