udp.c 25 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078
  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. * $Id: udp.c,v 1.65 2002/02/01 22:01:04 davem Exp $
  11. *
  12. * Fixes:
  13. * Hideaki YOSHIFUJI : sin6_scope_id support
  14. * YOSHIFUJI Hideaki @USAGI and: Support IPV6_V6ONLY socket option, which
  15. * Alexey Kuznetsov allow both IPv4 and IPv6 sockets to bind
  16. * a single port at the same time.
  17. * Kazunori MIYAZAWA @USAGI: change process style to use ip6_append_data
  18. * YOSHIFUJI Hideaki @USAGI: convert /proc/net/udp6 to seq_file.
  19. *
  20. * This program is free software; you can redistribute it and/or
  21. * modify it under the terms of the GNU General Public License
  22. * as published by the Free Software Foundation; either version
  23. * 2 of the License, or (at your option) any later version.
  24. */
  25. #include <linux/config.h>
  26. #include <linux/errno.h>
  27. #include <linux/types.h>
  28. #include <linux/socket.h>
  29. #include <linux/sockios.h>
  30. #include <linux/sched.h>
  31. #include <linux/net.h>
  32. #include <linux/in6.h>
  33. #include <linux/netdevice.h>
  34. #include <linux/if_arp.h>
  35. #include <linux/ipv6.h>
  36. #include <linux/icmpv6.h>
  37. #include <linux/init.h>
  38. #include <asm/uaccess.h>
  39. #include <net/sock.h>
  40. #include <net/snmp.h>
  41. #include <net/ipv6.h>
  42. #include <net/ndisc.h>
  43. #include <net/protocol.h>
  44. #include <net/transp_v6.h>
  45. #include <net/ip6_route.h>
  46. #include <net/addrconf.h>
  47. #include <net/ip.h>
  48. #include <net/udp.h>
  49. #include <net/raw.h>
  50. #include <net/inet_common.h>
  51. #include <net/tcp_states.h>
  52. #include <net/ip6_checksum.h>
  53. #include <net/xfrm.h>
  54. #include <linux/proc_fs.h>
  55. #include <linux/seq_file.h>
  56. DEFINE_SNMP_STAT(struct udp_mib, udp_stats_in6) __read_mostly;
  57. /* Grrr, addr_type already calculated by caller, but I don't want
  58. * to add some silly "cookie" argument to this method just for that.
  59. */
  60. static int udp_v6_get_port(struct sock *sk, unsigned short snum)
  61. {
  62. struct sock *sk2;
  63. struct hlist_node *node;
  64. write_lock_bh(&udp_hash_lock);
  65. if (snum == 0) {
  66. int best_size_so_far, best, result, i;
  67. if (udp_port_rover > sysctl_local_port_range[1] ||
  68. udp_port_rover < sysctl_local_port_range[0])
  69. udp_port_rover = sysctl_local_port_range[0];
  70. best_size_so_far = 32767;
  71. best = result = udp_port_rover;
  72. for (i = 0; i < UDP_HTABLE_SIZE; i++, result++) {
  73. int size;
  74. struct hlist_head *list;
  75. list = &udp_hash[result & (UDP_HTABLE_SIZE - 1)];
  76. if (hlist_empty(list)) {
  77. if (result > sysctl_local_port_range[1])
  78. result = sysctl_local_port_range[0] +
  79. ((result - sysctl_local_port_range[0]) &
  80. (UDP_HTABLE_SIZE - 1));
  81. goto gotit;
  82. }
  83. size = 0;
  84. sk_for_each(sk2, node, list)
  85. if (++size >= best_size_so_far)
  86. goto next;
  87. best_size_so_far = size;
  88. best = result;
  89. next:;
  90. }
  91. result = best;
  92. for(;; result += UDP_HTABLE_SIZE) {
  93. if (result > sysctl_local_port_range[1])
  94. result = sysctl_local_port_range[0]
  95. + ((result - sysctl_local_port_range[0]) &
  96. (UDP_HTABLE_SIZE - 1));
  97. if (!udp_lport_inuse(result))
  98. break;
  99. }
  100. gotit:
  101. udp_port_rover = snum = result;
  102. } else {
  103. sk_for_each(sk2, node,
  104. &udp_hash[snum & (UDP_HTABLE_SIZE - 1)]) {
  105. if (inet_sk(sk2)->num == snum &&
  106. sk2 != sk &&
  107. (!sk2->sk_bound_dev_if ||
  108. !sk->sk_bound_dev_if ||
  109. sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
  110. (!sk2->sk_reuse || !sk->sk_reuse) &&
  111. ipv6_rcv_saddr_equal(sk, sk2))
  112. goto fail;
  113. }
  114. }
  115. inet_sk(sk)->num = snum;
  116. if (sk_unhashed(sk)) {
  117. sk_add_node(sk, &udp_hash[snum & (UDP_HTABLE_SIZE - 1)]);
  118. sock_prot_inc_use(sk->sk_prot);
  119. }
  120. write_unlock_bh(&udp_hash_lock);
  121. return 0;
  122. fail:
  123. write_unlock_bh(&udp_hash_lock);
  124. return 1;
  125. }
  126. static void udp_v6_hash(struct sock *sk)
  127. {
  128. BUG();
  129. }
  130. static void udp_v6_unhash(struct sock *sk)
  131. {
  132. write_lock_bh(&udp_hash_lock);
  133. if (sk_del_node_init(sk)) {
  134. inet_sk(sk)->num = 0;
  135. sock_prot_dec_use(sk->sk_prot);
  136. }
  137. write_unlock_bh(&udp_hash_lock);
  138. }
  139. static struct sock *udp_v6_lookup(struct in6_addr *saddr, u16 sport,
  140. struct in6_addr *daddr, u16 dport, int dif)
  141. {
  142. struct sock *sk, *result = NULL;
  143. struct hlist_node *node;
  144. unsigned short hnum = ntohs(dport);
  145. int badness = -1;
  146. read_lock(&udp_hash_lock);
  147. sk_for_each(sk, node, &udp_hash[hnum & (UDP_HTABLE_SIZE - 1)]) {
  148. struct inet_sock *inet = inet_sk(sk);
  149. if (inet->num == hnum && sk->sk_family == PF_INET6) {
  150. struct ipv6_pinfo *np = inet6_sk(sk);
  151. int score = 0;
  152. if (inet->dport) {
  153. if (inet->dport != sport)
  154. continue;
  155. score++;
  156. }
  157. if (!ipv6_addr_any(&np->rcv_saddr)) {
  158. if (!ipv6_addr_equal(&np->rcv_saddr, daddr))
  159. continue;
  160. score++;
  161. }
  162. if (!ipv6_addr_any(&np->daddr)) {
  163. if (!ipv6_addr_equal(&np->daddr, saddr))
  164. continue;
  165. score++;
  166. }
  167. if (sk->sk_bound_dev_if) {
  168. if (sk->sk_bound_dev_if != dif)
  169. continue;
  170. score++;
  171. }
  172. if(score == 4) {
  173. result = sk;
  174. break;
  175. } else if(score > badness) {
  176. result = sk;
  177. badness = score;
  178. }
  179. }
  180. }
  181. if (result)
  182. sock_hold(result);
  183. read_unlock(&udp_hash_lock);
  184. return result;
  185. }
  186. /*
  187. *
  188. */
  189. static void udpv6_close(struct sock *sk, long timeout)
  190. {
  191. sk_common_release(sk);
  192. }
  193. /*
  194. * This should be easy, if there is something there we
  195. * return it, otherwise we block.
  196. */
  197. static int udpv6_recvmsg(struct kiocb *iocb, struct sock *sk,
  198. struct msghdr *msg, size_t len,
  199. int noblock, int flags, int *addr_len)
  200. {
  201. struct ipv6_pinfo *np = inet6_sk(sk);
  202. struct inet_sock *inet = inet_sk(sk);
  203. struct sk_buff *skb;
  204. size_t copied;
  205. int err;
  206. if (addr_len)
  207. *addr_len=sizeof(struct sockaddr_in6);
  208. if (flags & MSG_ERRQUEUE)
  209. return ipv6_recv_error(sk, msg, len);
  210. try_again:
  211. skb = skb_recv_datagram(sk, flags, noblock, &err);
  212. if (!skb)
  213. goto out;
  214. copied = skb->len - sizeof(struct udphdr);
  215. if (copied > len) {
  216. copied = len;
  217. msg->msg_flags |= MSG_TRUNC;
  218. }
  219. if (skb->ip_summed==CHECKSUM_UNNECESSARY) {
  220. err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr), msg->msg_iov,
  221. copied);
  222. } else if (msg->msg_flags&MSG_TRUNC) {
  223. if ((unsigned short)csum_fold(skb_checksum(skb, 0, skb->len, skb->csum)))
  224. goto csum_copy_err;
  225. err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr), msg->msg_iov,
  226. copied);
  227. } else {
  228. err = skb_copy_and_csum_datagram_iovec(skb, sizeof(struct udphdr), msg->msg_iov);
  229. if (err == -EINVAL)
  230. goto csum_copy_err;
  231. }
  232. if (err)
  233. goto out_free;
  234. sock_recv_timestamp(msg, sk, skb);
  235. /* Copy the address. */
  236. if (msg->msg_name) {
  237. struct sockaddr_in6 *sin6;
  238. sin6 = (struct sockaddr_in6 *) msg->msg_name;
  239. sin6->sin6_family = AF_INET6;
  240. sin6->sin6_port = skb->h.uh->source;
  241. sin6->sin6_flowinfo = 0;
  242. sin6->sin6_scope_id = 0;
  243. if (skb->protocol == htons(ETH_P_IP))
  244. ipv6_addr_set(&sin6->sin6_addr, 0, 0,
  245. htonl(0xffff), skb->nh.iph->saddr);
  246. else {
  247. ipv6_addr_copy(&sin6->sin6_addr, &skb->nh.ipv6h->saddr);
  248. if (ipv6_addr_type(&sin6->sin6_addr) & IPV6_ADDR_LINKLOCAL)
  249. sin6->sin6_scope_id = IP6CB(skb)->iif;
  250. }
  251. }
  252. if (skb->protocol == htons(ETH_P_IP)) {
  253. if (inet->cmsg_flags)
  254. ip_cmsg_recv(msg, skb);
  255. } else {
  256. if (np->rxopt.all)
  257. datagram_recv_ctl(sk, msg, skb);
  258. }
  259. err = copied;
  260. if (flags & MSG_TRUNC)
  261. err = skb->len - sizeof(struct udphdr);
  262. out_free:
  263. skb_free_datagram(sk, skb);
  264. out:
  265. return err;
  266. csum_copy_err:
  267. /* Clear queue. */
  268. if (flags&MSG_PEEK) {
  269. int clear = 0;
  270. spin_lock_bh(&sk->sk_receive_queue.lock);
  271. if (skb == skb_peek(&sk->sk_receive_queue)) {
  272. __skb_unlink(skb, &sk->sk_receive_queue);
  273. clear = 1;
  274. }
  275. spin_unlock_bh(&sk->sk_receive_queue.lock);
  276. if (clear)
  277. kfree_skb(skb);
  278. }
  279. skb_free_datagram(sk, skb);
  280. if (flags & MSG_DONTWAIT) {
  281. UDP6_INC_STATS_USER(UDP_MIB_INERRORS);
  282. return -EAGAIN;
  283. }
  284. goto try_again;
  285. }
  286. static void udpv6_err(struct sk_buff *skb, struct inet6_skb_parm *opt,
  287. int type, int code, int offset, __u32 info)
  288. {
  289. struct ipv6_pinfo *np;
  290. struct ipv6hdr *hdr = (struct ipv6hdr*)skb->data;
  291. struct net_device *dev = skb->dev;
  292. struct in6_addr *saddr = &hdr->saddr;
  293. struct in6_addr *daddr = &hdr->daddr;
  294. struct udphdr *uh = (struct udphdr*)(skb->data+offset);
  295. struct sock *sk;
  296. int err;
  297. sk = udp_v6_lookup(daddr, uh->dest, saddr, uh->source, dev->ifindex);
  298. if (sk == NULL)
  299. return;
  300. np = inet6_sk(sk);
  301. if (!icmpv6_err_convert(type, code, &err) && !np->recverr)
  302. goto out;
  303. if (sk->sk_state != TCP_ESTABLISHED && !np->recverr)
  304. goto out;
  305. if (np->recverr)
  306. ipv6_icmp_error(sk, skb, err, uh->dest, ntohl(info), (u8 *)(uh+1));
  307. sk->sk_err = err;
  308. sk->sk_error_report(sk);
  309. out:
  310. sock_put(sk);
  311. }
  312. static inline int udpv6_queue_rcv_skb(struct sock * sk, struct sk_buff *skb)
  313. {
  314. if (!xfrm6_policy_check(sk, XFRM_POLICY_IN, skb)) {
  315. kfree_skb(skb);
  316. return -1;
  317. }
  318. if (skb->ip_summed != CHECKSUM_UNNECESSARY) {
  319. if ((unsigned short)csum_fold(skb_checksum(skb, 0, skb->len, skb->csum))) {
  320. UDP6_INC_STATS_BH(UDP_MIB_INERRORS);
  321. kfree_skb(skb);
  322. return 0;
  323. }
  324. skb->ip_summed = CHECKSUM_UNNECESSARY;
  325. }
  326. if (sock_queue_rcv_skb(sk,skb)<0) {
  327. UDP6_INC_STATS_BH(UDP_MIB_INERRORS);
  328. kfree_skb(skb);
  329. return 0;
  330. }
  331. UDP6_INC_STATS_BH(UDP_MIB_INDATAGRAMS);
  332. return 0;
  333. }
  334. static struct sock *udp_v6_mcast_next(struct sock *sk,
  335. u16 loc_port, struct in6_addr *loc_addr,
  336. u16 rmt_port, struct in6_addr *rmt_addr,
  337. int dif)
  338. {
  339. struct hlist_node *node;
  340. struct sock *s = sk;
  341. unsigned short num = ntohs(loc_port);
  342. sk_for_each_from(s, node) {
  343. struct inet_sock *inet = inet_sk(s);
  344. if (inet->num == num && s->sk_family == PF_INET6) {
  345. struct ipv6_pinfo *np = inet6_sk(s);
  346. if (inet->dport) {
  347. if (inet->dport != rmt_port)
  348. continue;
  349. }
  350. if (!ipv6_addr_any(&np->daddr) &&
  351. !ipv6_addr_equal(&np->daddr, rmt_addr))
  352. continue;
  353. if (s->sk_bound_dev_if && s->sk_bound_dev_if != dif)
  354. continue;
  355. if (!ipv6_addr_any(&np->rcv_saddr)) {
  356. if (ipv6_addr_equal(&np->rcv_saddr, loc_addr))
  357. return s;
  358. continue;
  359. }
  360. if(!inet6_mc_check(s, loc_addr, rmt_addr))
  361. continue;
  362. return s;
  363. }
  364. }
  365. return NULL;
  366. }
  367. /*
  368. * Note: called only from the BH handler context,
  369. * so we don't need to lock the hashes.
  370. */
  371. static void udpv6_mcast_deliver(struct udphdr *uh,
  372. struct in6_addr *saddr, struct in6_addr *daddr,
  373. struct sk_buff *skb)
  374. {
  375. struct sock *sk, *sk2;
  376. int dif;
  377. read_lock(&udp_hash_lock);
  378. sk = sk_head(&udp_hash[ntohs(uh->dest) & (UDP_HTABLE_SIZE - 1)]);
  379. dif = skb->dev->ifindex;
  380. sk = udp_v6_mcast_next(sk, uh->dest, daddr, uh->source, saddr, dif);
  381. if (!sk) {
  382. kfree_skb(skb);
  383. goto out;
  384. }
  385. sk2 = sk;
  386. while ((sk2 = udp_v6_mcast_next(sk_next(sk2), uh->dest, daddr,
  387. uh->source, saddr, dif))) {
  388. struct sk_buff *buff = skb_clone(skb, GFP_ATOMIC);
  389. if (buff)
  390. udpv6_queue_rcv_skb(sk2, buff);
  391. }
  392. udpv6_queue_rcv_skb(sk, skb);
  393. out:
  394. read_unlock(&udp_hash_lock);
  395. }
  396. static int udpv6_rcv(struct sk_buff **pskb, unsigned int *nhoffp)
  397. {
  398. struct sk_buff *skb = *pskb;
  399. struct sock *sk;
  400. struct udphdr *uh;
  401. struct net_device *dev = skb->dev;
  402. struct in6_addr *saddr, *daddr;
  403. u32 ulen = 0;
  404. if (!pskb_may_pull(skb, sizeof(struct udphdr)))
  405. goto short_packet;
  406. saddr = &skb->nh.ipv6h->saddr;
  407. daddr = &skb->nh.ipv6h->daddr;
  408. uh = skb->h.uh;
  409. ulen = ntohs(uh->len);
  410. /* Check for jumbo payload */
  411. if (ulen == 0)
  412. ulen = skb->len;
  413. if (ulen > skb->len || ulen < sizeof(*uh))
  414. goto short_packet;
  415. if (uh->check == 0) {
  416. /* RFC 2460 section 8.1 says that we SHOULD log
  417. this error. Well, it is reasonable.
  418. */
  419. LIMIT_NETDEBUG(KERN_INFO "IPv6: udp checksum is 0\n");
  420. goto discard;
  421. }
  422. if (ulen < skb->len) {
  423. if (pskb_trim_rcsum(skb, ulen))
  424. goto discard;
  425. saddr = &skb->nh.ipv6h->saddr;
  426. daddr = &skb->nh.ipv6h->daddr;
  427. uh = skb->h.uh;
  428. }
  429. if (skb->ip_summed==CHECKSUM_HW) {
  430. skb->ip_summed = CHECKSUM_UNNECESSARY;
  431. if (csum_ipv6_magic(saddr, daddr, ulen, IPPROTO_UDP, skb->csum)) {
  432. LIMIT_NETDEBUG(KERN_DEBUG "udp v6 hw csum failure.\n");
  433. skb->ip_summed = CHECKSUM_NONE;
  434. }
  435. }
  436. if (skb->ip_summed != CHECKSUM_UNNECESSARY)
  437. skb->csum = ~csum_ipv6_magic(saddr, daddr, ulen, IPPROTO_UDP, 0);
  438. /*
  439. * Multicast receive code
  440. */
  441. if (ipv6_addr_is_multicast(daddr)) {
  442. udpv6_mcast_deliver(uh, saddr, daddr, skb);
  443. return 0;
  444. }
  445. /* Unicast */
  446. /*
  447. * check socket cache ... must talk to Alan about his plans
  448. * for sock caches... i'll skip this for now.
  449. */
  450. sk = udp_v6_lookup(saddr, uh->source, daddr, uh->dest, dev->ifindex);
  451. if (sk == NULL) {
  452. if (!xfrm6_policy_check(NULL, XFRM_POLICY_IN, skb))
  453. goto discard;
  454. if (skb->ip_summed != CHECKSUM_UNNECESSARY &&
  455. (unsigned short)csum_fold(skb_checksum(skb, 0, skb->len, skb->csum)))
  456. goto discard;
  457. UDP6_INC_STATS_BH(UDP_MIB_NOPORTS);
  458. icmpv6_send(skb, ICMPV6_DEST_UNREACH, ICMPV6_PORT_UNREACH, 0, dev);
  459. kfree_skb(skb);
  460. return(0);
  461. }
  462. /* deliver */
  463. udpv6_queue_rcv_skb(sk, skb);
  464. sock_put(sk);
  465. return(0);
  466. short_packet:
  467. if (net_ratelimit())
  468. printk(KERN_DEBUG "UDP: short packet: %d/%u\n", ulen, skb->len);
  469. discard:
  470. UDP6_INC_STATS_BH(UDP_MIB_INERRORS);
  471. kfree_skb(skb);
  472. return(0);
  473. }
  474. /*
  475. * Throw away all pending data and cancel the corking. Socket is locked.
  476. */
  477. static void udp_v6_flush_pending_frames(struct sock *sk)
  478. {
  479. struct udp_sock *up = udp_sk(sk);
  480. if (up->pending) {
  481. up->len = 0;
  482. up->pending = 0;
  483. ip6_flush_pending_frames(sk);
  484. }
  485. }
  486. /*
  487. * Sending
  488. */
  489. static int udp_v6_push_pending_frames(struct sock *sk, struct udp_sock *up)
  490. {
  491. struct sk_buff *skb;
  492. struct udphdr *uh;
  493. struct inet_sock *inet = inet_sk(sk);
  494. struct flowi *fl = &inet->cork.fl;
  495. int err = 0;
  496. /* Grab the skbuff where UDP header space exists. */
  497. if ((skb = skb_peek(&sk->sk_write_queue)) == NULL)
  498. goto out;
  499. /*
  500. * Create a UDP header
  501. */
  502. uh = skb->h.uh;
  503. uh->source = fl->fl_ip_sport;
  504. uh->dest = fl->fl_ip_dport;
  505. uh->len = htons(up->len);
  506. uh->check = 0;
  507. if (sk->sk_no_check == UDP_CSUM_NOXMIT) {
  508. skb->ip_summed = CHECKSUM_NONE;
  509. goto send;
  510. }
  511. if (skb_queue_len(&sk->sk_write_queue) == 1) {
  512. skb->csum = csum_partial((char *)uh,
  513. sizeof(struct udphdr), skb->csum);
  514. uh->check = csum_ipv6_magic(&fl->fl6_src,
  515. &fl->fl6_dst,
  516. up->len, fl->proto, skb->csum);
  517. } else {
  518. u32 tmp_csum = 0;
  519. skb_queue_walk(&sk->sk_write_queue, skb) {
  520. tmp_csum = csum_add(tmp_csum, skb->csum);
  521. }
  522. tmp_csum = csum_partial((char *)uh,
  523. sizeof(struct udphdr), tmp_csum);
  524. tmp_csum = csum_ipv6_magic(&fl->fl6_src,
  525. &fl->fl6_dst,
  526. up->len, fl->proto, tmp_csum);
  527. uh->check = tmp_csum;
  528. }
  529. if (uh->check == 0)
  530. uh->check = -1;
  531. send:
  532. err = ip6_push_pending_frames(sk);
  533. out:
  534. up->len = 0;
  535. up->pending = 0;
  536. return err;
  537. }
  538. static int udpv6_sendmsg(struct kiocb *iocb, struct sock *sk,
  539. struct msghdr *msg, size_t len)
  540. {
  541. struct ipv6_txoptions opt_space;
  542. struct udp_sock *up = udp_sk(sk);
  543. struct inet_sock *inet = inet_sk(sk);
  544. struct ipv6_pinfo *np = inet6_sk(sk);
  545. struct sockaddr_in6 *sin6 = (struct sockaddr_in6 *) msg->msg_name;
  546. struct in6_addr *daddr, *final_p = NULL, final;
  547. struct ipv6_txoptions *opt = NULL;
  548. struct ip6_flowlabel *flowlabel = NULL;
  549. struct flowi *fl = &inet->cork.fl;
  550. struct dst_entry *dst;
  551. int addr_len = msg->msg_namelen;
  552. int ulen = len;
  553. int hlimit = -1;
  554. int tclass = -1;
  555. int corkreq = up->corkflag || msg->msg_flags&MSG_MORE;
  556. int err;
  557. /* destination address check */
  558. if (sin6) {
  559. if (addr_len < offsetof(struct sockaddr, sa_data))
  560. return -EINVAL;
  561. switch (sin6->sin6_family) {
  562. case AF_INET6:
  563. if (addr_len < SIN6_LEN_RFC2133)
  564. return -EINVAL;
  565. daddr = &sin6->sin6_addr;
  566. break;
  567. case AF_INET:
  568. goto do_udp_sendmsg;
  569. case AF_UNSPEC:
  570. msg->msg_name = sin6 = NULL;
  571. msg->msg_namelen = addr_len = 0;
  572. daddr = NULL;
  573. break;
  574. default:
  575. return -EINVAL;
  576. }
  577. } else if (!up->pending) {
  578. if (sk->sk_state != TCP_ESTABLISHED)
  579. return -EDESTADDRREQ;
  580. daddr = &np->daddr;
  581. } else
  582. daddr = NULL;
  583. if (daddr) {
  584. if (ipv6_addr_type(daddr) == IPV6_ADDR_MAPPED) {
  585. struct sockaddr_in sin;
  586. sin.sin_family = AF_INET;
  587. sin.sin_port = sin6 ? sin6->sin6_port : inet->dport;
  588. sin.sin_addr.s_addr = daddr->s6_addr32[3];
  589. msg->msg_name = &sin;
  590. msg->msg_namelen = sizeof(sin);
  591. do_udp_sendmsg:
  592. if (__ipv6_only_sock(sk))
  593. return -ENETUNREACH;
  594. return udp_sendmsg(iocb, sk, msg, len);
  595. }
  596. }
  597. if (up->pending == AF_INET)
  598. return udp_sendmsg(iocb, sk, msg, len);
  599. /* Rough check on arithmetic overflow,
  600. better check is made in ip6_build_xmit
  601. */
  602. if (len > INT_MAX - sizeof(struct udphdr))
  603. return -EMSGSIZE;
  604. if (up->pending) {
  605. /*
  606. * There are pending frames.
  607. * The socket lock must be held while it's corked.
  608. */
  609. lock_sock(sk);
  610. if (likely(up->pending)) {
  611. if (unlikely(up->pending != AF_INET6)) {
  612. release_sock(sk);
  613. return -EAFNOSUPPORT;
  614. }
  615. dst = NULL;
  616. goto do_append_data;
  617. }
  618. release_sock(sk);
  619. }
  620. ulen += sizeof(struct udphdr);
  621. memset(fl, 0, sizeof(*fl));
  622. if (sin6) {
  623. if (sin6->sin6_port == 0)
  624. return -EINVAL;
  625. fl->fl_ip_dport = sin6->sin6_port;
  626. daddr = &sin6->sin6_addr;
  627. if (np->sndflow) {
  628. fl->fl6_flowlabel = sin6->sin6_flowinfo&IPV6_FLOWINFO_MASK;
  629. if (fl->fl6_flowlabel&IPV6_FLOWLABEL_MASK) {
  630. flowlabel = fl6_sock_lookup(sk, fl->fl6_flowlabel);
  631. if (flowlabel == NULL)
  632. return -EINVAL;
  633. daddr = &flowlabel->dst;
  634. }
  635. }
  636. /*
  637. * Otherwise it will be difficult to maintain
  638. * sk->sk_dst_cache.
  639. */
  640. if (sk->sk_state == TCP_ESTABLISHED &&
  641. ipv6_addr_equal(daddr, &np->daddr))
  642. daddr = &np->daddr;
  643. if (addr_len >= sizeof(struct sockaddr_in6) &&
  644. sin6->sin6_scope_id &&
  645. ipv6_addr_type(daddr)&IPV6_ADDR_LINKLOCAL)
  646. fl->oif = sin6->sin6_scope_id;
  647. } else {
  648. if (sk->sk_state != TCP_ESTABLISHED)
  649. return -EDESTADDRREQ;
  650. fl->fl_ip_dport = inet->dport;
  651. daddr = &np->daddr;
  652. fl->fl6_flowlabel = np->flow_label;
  653. }
  654. if (!fl->oif)
  655. fl->oif = sk->sk_bound_dev_if;
  656. if (msg->msg_controllen) {
  657. opt = &opt_space;
  658. memset(opt, 0, sizeof(struct ipv6_txoptions));
  659. opt->tot_len = sizeof(*opt);
  660. err = datagram_send_ctl(msg, fl, opt, &hlimit, &tclass);
  661. if (err < 0) {
  662. fl6_sock_release(flowlabel);
  663. return err;
  664. }
  665. if ((fl->fl6_flowlabel&IPV6_FLOWLABEL_MASK) && !flowlabel) {
  666. flowlabel = fl6_sock_lookup(sk, fl->fl6_flowlabel);
  667. if (flowlabel == NULL)
  668. return -EINVAL;
  669. }
  670. if (!(opt->opt_nflen|opt->opt_flen))
  671. opt = NULL;
  672. }
  673. if (opt == NULL)
  674. opt = np->opt;
  675. opt = fl6_merge_options(&opt_space, flowlabel, opt);
  676. fl->proto = IPPROTO_UDP;
  677. ipv6_addr_copy(&fl->fl6_dst, daddr);
  678. if (ipv6_addr_any(&fl->fl6_src) && !ipv6_addr_any(&np->saddr))
  679. ipv6_addr_copy(&fl->fl6_src, &np->saddr);
  680. fl->fl_ip_sport = inet->sport;
  681. /* merge ip6_build_xmit from ip6_output */
  682. if (opt && opt->srcrt) {
  683. struct rt0_hdr *rt0 = (struct rt0_hdr *) opt->srcrt;
  684. ipv6_addr_copy(&final, &fl->fl6_dst);
  685. ipv6_addr_copy(&fl->fl6_dst, rt0->addr);
  686. final_p = &final;
  687. }
  688. if (!fl->oif && ipv6_addr_is_multicast(&fl->fl6_dst))
  689. fl->oif = np->mcast_oif;
  690. err = ip6_dst_lookup(sk, &dst, fl);
  691. if (err)
  692. goto out;
  693. if (final_p)
  694. ipv6_addr_copy(&fl->fl6_dst, final_p);
  695. if ((err = xfrm_lookup(&dst, fl, sk, 0)) < 0)
  696. goto out;
  697. if (hlimit < 0) {
  698. if (ipv6_addr_is_multicast(&fl->fl6_dst))
  699. hlimit = np->mcast_hops;
  700. else
  701. hlimit = np->hop_limit;
  702. if (hlimit < 0)
  703. hlimit = dst_metric(dst, RTAX_HOPLIMIT);
  704. if (hlimit < 0)
  705. hlimit = ipv6_get_hoplimit(dst->dev);
  706. }
  707. if (tclass < 0) {
  708. tclass = np->tclass;
  709. if (tclass < 0)
  710. tclass = 0;
  711. }
  712. if (msg->msg_flags&MSG_CONFIRM)
  713. goto do_confirm;
  714. back_from_confirm:
  715. lock_sock(sk);
  716. if (unlikely(up->pending)) {
  717. /* The socket is already corked while preparing it. */
  718. /* ... which is an evident application bug. --ANK */
  719. release_sock(sk);
  720. LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 2\n");
  721. err = -EINVAL;
  722. goto out;
  723. }
  724. up->pending = AF_INET6;
  725. do_append_data:
  726. up->len += ulen;
  727. err = ip6_append_data(sk, ip_generic_getfrag, msg->msg_iov, ulen,
  728. sizeof(struct udphdr), hlimit, tclass, opt, fl,
  729. (struct rt6_info*)dst,
  730. corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags);
  731. if (err)
  732. udp_v6_flush_pending_frames(sk);
  733. else if (!corkreq)
  734. err = udp_v6_push_pending_frames(sk, up);
  735. if (dst)
  736. ip6_dst_store(sk, dst,
  737. ipv6_addr_equal(&fl->fl6_dst, &np->daddr) ?
  738. &np->daddr : NULL);
  739. if (err > 0)
  740. err = np->recverr ? net_xmit_errno(err) : 0;
  741. release_sock(sk);
  742. out:
  743. fl6_sock_release(flowlabel);
  744. if (!err) {
  745. UDP6_INC_STATS_USER(UDP_MIB_OUTDATAGRAMS);
  746. return len;
  747. }
  748. return err;
  749. do_confirm:
  750. dst_confirm(dst);
  751. if (!(msg->msg_flags&MSG_PROBE) || len)
  752. goto back_from_confirm;
  753. err = 0;
  754. goto out;
  755. }
  756. static int udpv6_destroy_sock(struct sock *sk)
  757. {
  758. lock_sock(sk);
  759. udp_v6_flush_pending_frames(sk);
  760. release_sock(sk);
  761. inet6_destroy_sock(sk);
  762. return 0;
  763. }
  764. /*
  765. * Socket option code for UDP
  766. */
  767. static int udpv6_setsockopt(struct sock *sk, int level, int optname,
  768. char __user *optval, int optlen)
  769. {
  770. struct udp_sock *up = udp_sk(sk);
  771. int val;
  772. int err = 0;
  773. if (level != SOL_UDP)
  774. return ipv6_setsockopt(sk, level, optname, optval, optlen);
  775. if(optlen<sizeof(int))
  776. return -EINVAL;
  777. if (get_user(val, (int __user *)optval))
  778. return -EFAULT;
  779. switch(optname) {
  780. case UDP_CORK:
  781. if (val != 0) {
  782. up->corkflag = 1;
  783. } else {
  784. up->corkflag = 0;
  785. lock_sock(sk);
  786. udp_v6_push_pending_frames(sk, up);
  787. release_sock(sk);
  788. }
  789. break;
  790. case UDP_ENCAP:
  791. switch (val) {
  792. case 0:
  793. up->encap_type = val;
  794. break;
  795. default:
  796. err = -ENOPROTOOPT;
  797. break;
  798. }
  799. break;
  800. default:
  801. err = -ENOPROTOOPT;
  802. break;
  803. };
  804. return err;
  805. }
  806. static int udpv6_getsockopt(struct sock *sk, int level, int optname,
  807. char __user *optval, int __user *optlen)
  808. {
  809. struct udp_sock *up = udp_sk(sk);
  810. int val, len;
  811. if (level != SOL_UDP)
  812. return ipv6_getsockopt(sk, level, optname, optval, optlen);
  813. if(get_user(len,optlen))
  814. return -EFAULT;
  815. len = min_t(unsigned int, len, sizeof(int));
  816. if(len < 0)
  817. return -EINVAL;
  818. switch(optname) {
  819. case UDP_CORK:
  820. val = up->corkflag;
  821. break;
  822. case UDP_ENCAP:
  823. val = up->encap_type;
  824. break;
  825. default:
  826. return -ENOPROTOOPT;
  827. };
  828. if(put_user(len, optlen))
  829. return -EFAULT;
  830. if(copy_to_user(optval, &val,len))
  831. return -EFAULT;
  832. return 0;
  833. }
  834. static struct inet6_protocol udpv6_protocol = {
  835. .handler = udpv6_rcv,
  836. .err_handler = udpv6_err,
  837. .flags = INET6_PROTO_NOPOLICY|INET6_PROTO_FINAL,
  838. };
  839. /* ------------------------------------------------------------------------ */
  840. #ifdef CONFIG_PROC_FS
  841. static void udp6_sock_seq_show(struct seq_file *seq, struct sock *sp, int bucket)
  842. {
  843. struct inet_sock *inet = inet_sk(sp);
  844. struct ipv6_pinfo *np = inet6_sk(sp);
  845. struct in6_addr *dest, *src;
  846. __u16 destp, srcp;
  847. dest = &np->daddr;
  848. src = &np->rcv_saddr;
  849. destp = ntohs(inet->dport);
  850. srcp = ntohs(inet->sport);
  851. seq_printf(seq,
  852. "%4d: %08X%08X%08X%08X:%04X %08X%08X%08X%08X:%04X "
  853. "%02X %08X:%08X %02X:%08lX %08X %5d %8d %lu %d %p\n",
  854. bucket,
  855. src->s6_addr32[0], src->s6_addr32[1],
  856. src->s6_addr32[2], src->s6_addr32[3], srcp,
  857. dest->s6_addr32[0], dest->s6_addr32[1],
  858. dest->s6_addr32[2], dest->s6_addr32[3], destp,
  859. sp->sk_state,
  860. atomic_read(&sp->sk_wmem_alloc),
  861. atomic_read(&sp->sk_rmem_alloc),
  862. 0, 0L, 0,
  863. sock_i_uid(sp), 0,
  864. sock_i_ino(sp),
  865. atomic_read(&sp->sk_refcnt), sp);
  866. }
  867. static int udp6_seq_show(struct seq_file *seq, void *v)
  868. {
  869. if (v == SEQ_START_TOKEN)
  870. seq_printf(seq,
  871. " sl "
  872. "local_address "
  873. "remote_address "
  874. "st tx_queue rx_queue tr tm->when retrnsmt"
  875. " uid timeout inode\n");
  876. else
  877. udp6_sock_seq_show(seq, v, ((struct udp_iter_state *)seq->private)->bucket);
  878. return 0;
  879. }
  880. static struct file_operations udp6_seq_fops;
  881. static struct udp_seq_afinfo udp6_seq_afinfo = {
  882. .owner = THIS_MODULE,
  883. .name = "udp6",
  884. .family = AF_INET6,
  885. .seq_show = udp6_seq_show,
  886. .seq_fops = &udp6_seq_fops,
  887. };
  888. int __init udp6_proc_init(void)
  889. {
  890. return udp_proc_register(&udp6_seq_afinfo);
  891. }
  892. void udp6_proc_exit(void) {
  893. udp_proc_unregister(&udp6_seq_afinfo);
  894. }
  895. #endif /* CONFIG_PROC_FS */
  896. /* ------------------------------------------------------------------------ */
  897. struct proto udpv6_prot = {
  898. .name = "UDPv6",
  899. .owner = THIS_MODULE,
  900. .close = udpv6_close,
  901. .connect = ip6_datagram_connect,
  902. .disconnect = udp_disconnect,
  903. .ioctl = udp_ioctl,
  904. .destroy = udpv6_destroy_sock,
  905. .setsockopt = udpv6_setsockopt,
  906. .getsockopt = udpv6_getsockopt,
  907. .sendmsg = udpv6_sendmsg,
  908. .recvmsg = udpv6_recvmsg,
  909. .backlog_rcv = udpv6_queue_rcv_skb,
  910. .hash = udp_v6_hash,
  911. .unhash = udp_v6_unhash,
  912. .get_port = udp_v6_get_port,
  913. .obj_size = sizeof(struct udp6_sock),
  914. };
  915. static struct inet_protosw udpv6_protosw = {
  916. .type = SOCK_DGRAM,
  917. .protocol = IPPROTO_UDP,
  918. .prot = &udpv6_prot,
  919. .ops = &inet6_dgram_ops,
  920. .capability =-1,
  921. .no_check = UDP_CSUM_DEFAULT,
  922. .flags = INET_PROTOSW_PERMANENT,
  923. };
  924. void __init udpv6_init(void)
  925. {
  926. if (inet6_add_protocol(&udpv6_protocol, IPPROTO_UDP) < 0)
  927. printk(KERN_ERR "udpv6_init: Could not register protocol\n");
  928. inet6_register_protosw(&udpv6_protosw);
  929. }