udp.c 37 KB

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