udp.c 41 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661
  1. /*
  2. * INET An implementation of the TCP/IP protocol suite for the LINUX
  3. * operating system. INET is implemented using the BSD Socket
  4. * interface as the means of communication with the user level.
  5. *
  6. * The User Datagram Protocol (UDP).
  7. *
  8. * Version: $Id: udp.c,v 1.102 2002/02/01 22:01:04 davem Exp $
  9. *
  10. * Authors: Ross Biro
  11. * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
  12. * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
  13. * Alan Cox, <Alan.Cox@linux.org>
  14. * Hirokazu Takahashi, <taka@valinux.co.jp>
  15. *
  16. * Fixes:
  17. * Alan Cox : verify_area() calls
  18. * Alan Cox : stopped close while in use off icmp
  19. * messages. Not a fix but a botch that
  20. * for udp at least is 'valid'.
  21. * Alan Cox : Fixed icmp handling properly
  22. * Alan Cox : Correct error for oversized datagrams
  23. * Alan Cox : Tidied select() semantics.
  24. * Alan Cox : udp_err() fixed properly, also now
  25. * select and read wake correctly on errors
  26. * Alan Cox : udp_send verify_area moved to avoid mem leak
  27. * Alan Cox : UDP can count its memory
  28. * Alan Cox : send to an unknown connection causes
  29. * an ECONNREFUSED off the icmp, but
  30. * does NOT close.
  31. * Alan Cox : Switched to new sk_buff handlers. No more backlog!
  32. * Alan Cox : Using generic datagram code. Even smaller and the PEEK
  33. * bug no longer crashes it.
  34. * Fred Van Kempen : Net2e support for sk->broadcast.
  35. * Alan Cox : Uses skb_free_datagram
  36. * Alan Cox : Added get/set sockopt support.
  37. * Alan Cox : Broadcasting without option set returns EACCES.
  38. * Alan Cox : No wakeup calls. Instead we now use the callbacks.
  39. * Alan Cox : Use ip_tos and ip_ttl
  40. * Alan Cox : SNMP Mibs
  41. * Alan Cox : MSG_DONTROUTE, and 0.0.0.0 support.
  42. * Matt Dillon : UDP length checks.
  43. * Alan Cox : Smarter af_inet used properly.
  44. * Alan Cox : Use new kernel side addressing.
  45. * Alan Cox : Incorrect return on truncated datagram receive.
  46. * Arnt Gulbrandsen : New udp_send and stuff
  47. * Alan Cox : Cache last socket
  48. * Alan Cox : Route cache
  49. * Jon Peatfield : Minor efficiency fix to sendto().
  50. * Mike Shaver : RFC1122 checks.
  51. * Alan Cox : Nonblocking error fix.
  52. * Willy Konynenberg : Transparent proxying support.
  53. * Mike McLagan : Routing by source
  54. * David S. Miller : New socket lookup architecture.
  55. * Last socket cache retained as it
  56. * does have a high hit rate.
  57. * Olaf Kirch : Don't linearise iovec on sendmsg.
  58. * Andi Kleen : Some cleanups, cache destination entry
  59. * for connect.
  60. * Vitaly E. Lavrov : Transparent proxy revived after year coma.
  61. * Melvin Smith : Check msg_name not msg_namelen in sendto(),
  62. * return ENOTCONN for unconnected sockets (POSIX)
  63. * Janos Farkas : don't deliver multi/broadcasts to a different
  64. * bound-to-device socket
  65. * Hirokazu Takahashi : HW checksumming for outgoing UDP
  66. * datagrams.
  67. * Hirokazu Takahashi : sendfile() on UDP works now.
  68. * Arnaldo C. Melo : convert /proc/net/udp to seq_file
  69. * YOSHIFUJI Hideaki @USAGI and: Support IPV6_V6ONLY socket option, which
  70. * Alexey Kuznetsov: allow both IPv4 and IPv6 sockets to bind
  71. * a single port at the same time.
  72. * Derek Atkins <derek@ihtfp.com>: Add Encapulation Support
  73. * James Chapman : Add L2TP encapsulation type.
  74. *
  75. *
  76. * This program is free software; you can redistribute it and/or
  77. * modify it under the terms of the GNU General Public License
  78. * as published by the Free Software Foundation; either version
  79. * 2 of the License, or (at your option) any later version.
  80. */
  81. #include <asm/system.h>
  82. #include <asm/uaccess.h>
  83. #include <asm/ioctls.h>
  84. #include <linux/types.h>
  85. #include <linux/fcntl.h>
  86. #include <linux/module.h>
  87. #include <linux/socket.h>
  88. #include <linux/sockios.h>
  89. #include <linux/igmp.h>
  90. #include <linux/in.h>
  91. #include <linux/errno.h>
  92. #include <linux/timer.h>
  93. #include <linux/mm.h>
  94. #include <linux/inet.h>
  95. #include <linux/netdevice.h>
  96. #include <net/tcp_states.h>
  97. #include <linux/skbuff.h>
  98. #include <linux/proc_fs.h>
  99. #include <linux/seq_file.h>
  100. #include <net/net_namespace.h>
  101. #include <net/icmp.h>
  102. #include <net/route.h>
  103. #include <net/checksum.h>
  104. #include <net/xfrm.h>
  105. #include "udp_impl.h"
  106. /*
  107. * Snmp MIB for the UDP layer
  108. */
  109. DEFINE_SNMP_STAT(struct udp_mib, udp_statistics) __read_mostly;
  110. struct hlist_head udp_hash[UDP_HTABLE_SIZE];
  111. DEFINE_RWLOCK(udp_hash_lock);
  112. static inline int __udp_lib_lport_inuse(__u16 num,
  113. const struct hlist_head udptable[])
  114. {
  115. struct sock *sk;
  116. struct hlist_node *node;
  117. sk_for_each(sk, node, &udptable[num & (UDP_HTABLE_SIZE - 1)])
  118. if (sk->sk_hash == num)
  119. return 1;
  120. return 0;
  121. }
  122. /**
  123. * __udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
  124. *
  125. * @sk: socket struct in question
  126. * @snum: port number to look up
  127. * @udptable: hash list table, must be of UDP_HTABLE_SIZE
  128. * @saddr_comp: AF-dependent comparison of bound local IP addresses
  129. */
  130. int __udp_lib_get_port(struct sock *sk, unsigned short snum,
  131. struct hlist_head udptable[],
  132. int (*saddr_comp)(const struct sock *sk1,
  133. const struct sock *sk2 ) )
  134. {
  135. struct hlist_node *node;
  136. struct hlist_head *head;
  137. struct sock *sk2;
  138. int error = 1;
  139. write_lock_bh(&udp_hash_lock);
  140. if (!snum) {
  141. int i, low, high, remaining;
  142. unsigned rover, best, best_size_so_far;
  143. inet_get_local_port_range(&low, &high);
  144. remaining = (high - low) + 1;
  145. best_size_so_far = UINT_MAX;
  146. best = rover = net_random() % remaining + low;
  147. /* 1st pass: look for empty (or shortest) hash chain */
  148. for (i = 0; i < UDP_HTABLE_SIZE; i++) {
  149. int size = 0;
  150. head = &udptable[rover & (UDP_HTABLE_SIZE - 1)];
  151. if (hlist_empty(head))
  152. goto gotit;
  153. sk_for_each(sk2, node, head) {
  154. if (++size >= best_size_so_far)
  155. goto next;
  156. }
  157. best_size_so_far = size;
  158. best = rover;
  159. next:
  160. /* fold back if end of range */
  161. if (++rover > high)
  162. rover = low + ((rover - low)
  163. & (UDP_HTABLE_SIZE - 1));
  164. }
  165. /* 2nd pass: find hole in shortest hash chain */
  166. rover = best;
  167. for (i = 0; i < (1 << 16) / UDP_HTABLE_SIZE; i++) {
  168. if (! __udp_lib_lport_inuse(rover, udptable))
  169. goto gotit;
  170. rover += UDP_HTABLE_SIZE;
  171. if (rover > high)
  172. rover = low + ((rover - low)
  173. & (UDP_HTABLE_SIZE - 1));
  174. }
  175. /* All ports in use! */
  176. goto fail;
  177. gotit:
  178. snum = rover;
  179. } else {
  180. head = &udptable[snum & (UDP_HTABLE_SIZE - 1)];
  181. sk_for_each(sk2, node, head)
  182. if (sk2->sk_hash == snum &&
  183. sk2 != sk &&
  184. (!sk2->sk_reuse || !sk->sk_reuse) &&
  185. (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if
  186. || sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
  187. (*saddr_comp)(sk, sk2) )
  188. goto fail;
  189. }
  190. inet_sk(sk)->num = snum;
  191. sk->sk_hash = snum;
  192. if (sk_unhashed(sk)) {
  193. head = &udptable[snum & (UDP_HTABLE_SIZE - 1)];
  194. sk_add_node(sk, head);
  195. sock_prot_inc_use(sk->sk_prot);
  196. }
  197. error = 0;
  198. fail:
  199. write_unlock_bh(&udp_hash_lock);
  200. return error;
  201. }
  202. int udp_get_port(struct sock *sk, unsigned short snum,
  203. int (*scmp)(const struct sock *, const struct sock *))
  204. {
  205. return __udp_lib_get_port(sk, snum, udp_hash, scmp);
  206. }
  207. int ipv4_rcv_saddr_equal(const struct sock *sk1, const struct sock *sk2)
  208. {
  209. struct inet_sock *inet1 = inet_sk(sk1), *inet2 = inet_sk(sk2);
  210. return ( !ipv6_only_sock(sk2) &&
  211. (!inet1->rcv_saddr || !inet2->rcv_saddr ||
  212. inet1->rcv_saddr == inet2->rcv_saddr ));
  213. }
  214. static inline int udp_v4_get_port(struct sock *sk, unsigned short snum)
  215. {
  216. return udp_get_port(sk, snum, ipv4_rcv_saddr_equal);
  217. }
  218. /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
  219. * harder than this. -DaveM
  220. */
  221. static struct sock *__udp4_lib_lookup(__be32 saddr, __be16 sport,
  222. __be32 daddr, __be16 dport,
  223. int dif, struct hlist_head udptable[])
  224. {
  225. struct sock *sk, *result = NULL;
  226. struct hlist_node *node;
  227. unsigned short hnum = ntohs(dport);
  228. int badness = -1;
  229. read_lock(&udp_hash_lock);
  230. sk_for_each(sk, node, &udptable[hnum & (UDP_HTABLE_SIZE - 1)]) {
  231. struct inet_sock *inet = inet_sk(sk);
  232. if (sk->sk_hash == hnum && !ipv6_only_sock(sk)) {
  233. int score = (sk->sk_family == PF_INET ? 1 : 0);
  234. if (inet->rcv_saddr) {
  235. if (inet->rcv_saddr != daddr)
  236. continue;
  237. score+=2;
  238. }
  239. if (inet->daddr) {
  240. if (inet->daddr != saddr)
  241. continue;
  242. score+=2;
  243. }
  244. if (inet->dport) {
  245. if (inet->dport != sport)
  246. continue;
  247. score+=2;
  248. }
  249. if (sk->sk_bound_dev_if) {
  250. if (sk->sk_bound_dev_if != dif)
  251. continue;
  252. score+=2;
  253. }
  254. if (score == 9) {
  255. result = sk;
  256. break;
  257. } else if (score > badness) {
  258. result = sk;
  259. badness = score;
  260. }
  261. }
  262. }
  263. if (result)
  264. sock_hold(result);
  265. read_unlock(&udp_hash_lock);
  266. return result;
  267. }
  268. static inline struct sock *udp_v4_mcast_next(struct sock *sk,
  269. __be16 loc_port, __be32 loc_addr,
  270. __be16 rmt_port, __be32 rmt_addr,
  271. int dif)
  272. {
  273. struct hlist_node *node;
  274. struct sock *s = sk;
  275. unsigned short hnum = ntohs(loc_port);
  276. sk_for_each_from(s, node) {
  277. struct inet_sock *inet = inet_sk(s);
  278. if (s->sk_hash != hnum ||
  279. (inet->daddr && inet->daddr != rmt_addr) ||
  280. (inet->dport != rmt_port && inet->dport) ||
  281. (inet->rcv_saddr && inet->rcv_saddr != loc_addr) ||
  282. ipv6_only_sock(s) ||
  283. (s->sk_bound_dev_if && s->sk_bound_dev_if != dif))
  284. continue;
  285. if (!ip_mc_sf_allow(s, loc_addr, rmt_addr, dif))
  286. continue;
  287. goto found;
  288. }
  289. s = NULL;
  290. found:
  291. return s;
  292. }
  293. /*
  294. * This routine is called by the ICMP module when it gets some
  295. * sort of error condition. If err < 0 then the socket should
  296. * be closed and the error returned to the user. If err > 0
  297. * it's just the icmp type << 8 | icmp code.
  298. * Header points to the ip header of the error packet. We move
  299. * on past this. Then (as it used to claim before adjustment)
  300. * header points to the first 8 bytes of the udp header. We need
  301. * to find the appropriate port.
  302. */
  303. void __udp4_lib_err(struct sk_buff *skb, u32 info, struct hlist_head udptable[])
  304. {
  305. struct inet_sock *inet;
  306. struct iphdr *iph = (struct iphdr*)skb->data;
  307. struct udphdr *uh = (struct udphdr*)(skb->data+(iph->ihl<<2));
  308. const int type = icmp_hdr(skb)->type;
  309. const int code = icmp_hdr(skb)->code;
  310. struct sock *sk;
  311. int harderr;
  312. int err;
  313. sk = __udp4_lib_lookup(iph->daddr, uh->dest, iph->saddr, uh->source,
  314. skb->dev->ifindex, udptable );
  315. if (sk == NULL) {
  316. ICMP_INC_STATS_BH(ICMP_MIB_INERRORS);
  317. return; /* No socket for error */
  318. }
  319. err = 0;
  320. harderr = 0;
  321. inet = inet_sk(sk);
  322. switch (type) {
  323. default:
  324. case ICMP_TIME_EXCEEDED:
  325. err = EHOSTUNREACH;
  326. break;
  327. case ICMP_SOURCE_QUENCH:
  328. goto out;
  329. case ICMP_PARAMETERPROB:
  330. err = EPROTO;
  331. harderr = 1;
  332. break;
  333. case ICMP_DEST_UNREACH:
  334. if (code == ICMP_FRAG_NEEDED) { /* Path MTU discovery */
  335. if (inet->pmtudisc != IP_PMTUDISC_DONT) {
  336. err = EMSGSIZE;
  337. harderr = 1;
  338. break;
  339. }
  340. goto out;
  341. }
  342. err = EHOSTUNREACH;
  343. if (code <= NR_ICMP_UNREACH) {
  344. harderr = icmp_err_convert[code].fatal;
  345. err = icmp_err_convert[code].errno;
  346. }
  347. break;
  348. }
  349. /*
  350. * RFC1122: OK. Passes ICMP errors back to application, as per
  351. * 4.1.3.3.
  352. */
  353. if (!inet->recverr) {
  354. if (!harderr || sk->sk_state != TCP_ESTABLISHED)
  355. goto out;
  356. } else {
  357. ip_icmp_error(sk, skb, err, uh->dest, info, (u8*)(uh+1));
  358. }
  359. sk->sk_err = err;
  360. sk->sk_error_report(sk);
  361. out:
  362. sock_put(sk);
  363. }
  364. void udp_err(struct sk_buff *skb, u32 info)
  365. {
  366. return __udp4_lib_err(skb, info, udp_hash);
  367. }
  368. /*
  369. * Throw away all pending data and cancel the corking. Socket is locked.
  370. */
  371. static void udp_flush_pending_frames(struct sock *sk)
  372. {
  373. struct udp_sock *up = udp_sk(sk);
  374. if (up->pending) {
  375. up->len = 0;
  376. up->pending = 0;
  377. ip_flush_pending_frames(sk);
  378. }
  379. }
  380. /**
  381. * udp4_hwcsum_outgoing - handle outgoing HW checksumming
  382. * @sk: socket we are sending on
  383. * @skb: sk_buff containing the filled-in UDP header
  384. * (checksum field must be zeroed out)
  385. */
  386. static void udp4_hwcsum_outgoing(struct sock *sk, struct sk_buff *skb,
  387. __be32 src, __be32 dst, int len )
  388. {
  389. unsigned int offset;
  390. struct udphdr *uh = udp_hdr(skb);
  391. __wsum csum = 0;
  392. if (skb_queue_len(&sk->sk_write_queue) == 1) {
  393. /*
  394. * Only one fragment on the socket.
  395. */
  396. skb->csum_start = skb_transport_header(skb) - skb->head;
  397. skb->csum_offset = offsetof(struct udphdr, check);
  398. uh->check = ~csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, 0);
  399. } else {
  400. /*
  401. * HW-checksum won't work as there are two or more
  402. * fragments on the socket so that all csums of sk_buffs
  403. * should be together
  404. */
  405. offset = skb_transport_offset(skb);
  406. skb->csum = skb_checksum(skb, offset, skb->len - offset, 0);
  407. skb->ip_summed = CHECKSUM_NONE;
  408. skb_queue_walk(&sk->sk_write_queue, skb) {
  409. csum = csum_add(csum, skb->csum);
  410. }
  411. uh->check = csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, csum);
  412. if (uh->check == 0)
  413. uh->check = CSUM_MANGLED_0;
  414. }
  415. }
  416. /*
  417. * Push out all pending data as one UDP datagram. Socket is locked.
  418. */
  419. static int udp_push_pending_frames(struct sock *sk)
  420. {
  421. struct udp_sock *up = udp_sk(sk);
  422. struct inet_sock *inet = inet_sk(sk);
  423. struct flowi *fl = &inet->cork.fl;
  424. struct sk_buff *skb;
  425. struct udphdr *uh;
  426. int err = 0;
  427. __wsum csum = 0;
  428. /* Grab the skbuff where UDP header space exists. */
  429. if ((skb = skb_peek(&sk->sk_write_queue)) == NULL)
  430. goto out;
  431. /*
  432. * Create a UDP header
  433. */
  434. uh = udp_hdr(skb);
  435. uh->source = fl->fl_ip_sport;
  436. uh->dest = fl->fl_ip_dport;
  437. uh->len = htons(up->len);
  438. uh->check = 0;
  439. if (up->pcflag) /* UDP-Lite */
  440. csum = udplite_csum_outgoing(sk, skb);
  441. else if (sk->sk_no_check == UDP_CSUM_NOXMIT) { /* UDP csum disabled */
  442. skb->ip_summed = CHECKSUM_NONE;
  443. goto send;
  444. } else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */
  445. udp4_hwcsum_outgoing(sk, skb, fl->fl4_src,fl->fl4_dst, up->len);
  446. goto send;
  447. } else /* `normal' UDP */
  448. csum = udp_csum_outgoing(sk, skb);
  449. /* add protocol-dependent pseudo-header */
  450. uh->check = csum_tcpudp_magic(fl->fl4_src, fl->fl4_dst, up->len,
  451. sk->sk_protocol, csum );
  452. if (uh->check == 0)
  453. uh->check = CSUM_MANGLED_0;
  454. send:
  455. err = ip_push_pending_frames(sk);
  456. out:
  457. up->len = 0;
  458. up->pending = 0;
  459. if (!err)
  460. UDP_INC_STATS_USER(UDP_MIB_OUTDATAGRAMS, up->pcflag);
  461. return err;
  462. }
  463. int udp_sendmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
  464. size_t len)
  465. {
  466. struct inet_sock *inet = inet_sk(sk);
  467. struct udp_sock *up = udp_sk(sk);
  468. int ulen = len;
  469. struct ipcm_cookie ipc;
  470. struct rtable *rt = NULL;
  471. int free = 0;
  472. int connected = 0;
  473. __be32 daddr, faddr, saddr;
  474. __be16 dport;
  475. u8 tos;
  476. int err, is_udplite = up->pcflag;
  477. int corkreq = up->corkflag || msg->msg_flags&MSG_MORE;
  478. int (*getfrag)(void *, char *, int, int, int, struct sk_buff *);
  479. if (len > 0xFFFF)
  480. return -EMSGSIZE;
  481. /*
  482. * Check the flags.
  483. */
  484. if (msg->msg_flags&MSG_OOB) /* Mirror BSD error message compatibility */
  485. return -EOPNOTSUPP;
  486. ipc.opt = NULL;
  487. if (up->pending) {
  488. /*
  489. * There are pending frames.
  490. * The socket lock must be held while it's corked.
  491. */
  492. lock_sock(sk);
  493. if (likely(up->pending)) {
  494. if (unlikely(up->pending != AF_INET)) {
  495. release_sock(sk);
  496. return -EINVAL;
  497. }
  498. goto do_append_data;
  499. }
  500. release_sock(sk);
  501. }
  502. ulen += sizeof(struct udphdr);
  503. /*
  504. * Get and verify the address.
  505. */
  506. if (msg->msg_name) {
  507. struct sockaddr_in * usin = (struct sockaddr_in*)msg->msg_name;
  508. if (msg->msg_namelen < sizeof(*usin))
  509. return -EINVAL;
  510. if (usin->sin_family != AF_INET) {
  511. if (usin->sin_family != AF_UNSPEC)
  512. return -EAFNOSUPPORT;
  513. }
  514. daddr = usin->sin_addr.s_addr;
  515. dport = usin->sin_port;
  516. if (dport == 0)
  517. return -EINVAL;
  518. } else {
  519. if (sk->sk_state != TCP_ESTABLISHED)
  520. return -EDESTADDRREQ;
  521. daddr = inet->daddr;
  522. dport = inet->dport;
  523. /* Open fast path for connected socket.
  524. Route will not be used, if at least one option is set.
  525. */
  526. connected = 1;
  527. }
  528. ipc.addr = inet->saddr;
  529. ipc.oif = sk->sk_bound_dev_if;
  530. if (msg->msg_controllen) {
  531. err = ip_cmsg_send(msg, &ipc);
  532. if (err)
  533. return err;
  534. if (ipc.opt)
  535. free = 1;
  536. connected = 0;
  537. }
  538. if (!ipc.opt)
  539. ipc.opt = inet->opt;
  540. saddr = ipc.addr;
  541. ipc.addr = faddr = daddr;
  542. if (ipc.opt && ipc.opt->srr) {
  543. if (!daddr)
  544. return -EINVAL;
  545. faddr = ipc.opt->faddr;
  546. connected = 0;
  547. }
  548. tos = RT_TOS(inet->tos);
  549. if (sock_flag(sk, SOCK_LOCALROUTE) ||
  550. (msg->msg_flags & MSG_DONTROUTE) ||
  551. (ipc.opt && ipc.opt->is_strictroute)) {
  552. tos |= RTO_ONLINK;
  553. connected = 0;
  554. }
  555. if (MULTICAST(daddr)) {
  556. if (!ipc.oif)
  557. ipc.oif = inet->mc_index;
  558. if (!saddr)
  559. saddr = inet->mc_addr;
  560. connected = 0;
  561. }
  562. if (connected)
  563. rt = (struct rtable*)sk_dst_check(sk, 0);
  564. if (rt == NULL) {
  565. struct flowi fl = { .oif = ipc.oif,
  566. .nl_u = { .ip4_u =
  567. { .daddr = faddr,
  568. .saddr = saddr,
  569. .tos = tos } },
  570. .proto = sk->sk_protocol,
  571. .uli_u = { .ports =
  572. { .sport = inet->sport,
  573. .dport = dport } } };
  574. security_sk_classify_flow(sk, &fl);
  575. err = ip_route_output_flow(&rt, &fl, sk, 1);
  576. if (err) {
  577. if (err == -ENETUNREACH)
  578. IP_INC_STATS_BH(IPSTATS_MIB_OUTNOROUTES);
  579. goto out;
  580. }
  581. err = -EACCES;
  582. if ((rt->rt_flags & RTCF_BROADCAST) &&
  583. !sock_flag(sk, SOCK_BROADCAST))
  584. goto out;
  585. if (connected)
  586. sk_dst_set(sk, dst_clone(&rt->u.dst));
  587. }
  588. if (msg->msg_flags&MSG_CONFIRM)
  589. goto do_confirm;
  590. back_from_confirm:
  591. saddr = rt->rt_src;
  592. if (!ipc.addr)
  593. daddr = ipc.addr = rt->rt_dst;
  594. lock_sock(sk);
  595. if (unlikely(up->pending)) {
  596. /* The socket is already corked while preparing it. */
  597. /* ... which is an evident application bug. --ANK */
  598. release_sock(sk);
  599. LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 2\n");
  600. err = -EINVAL;
  601. goto out;
  602. }
  603. /*
  604. * Now cork the socket to pend data.
  605. */
  606. inet->cork.fl.fl4_dst = daddr;
  607. inet->cork.fl.fl_ip_dport = dport;
  608. inet->cork.fl.fl4_src = saddr;
  609. inet->cork.fl.fl_ip_sport = inet->sport;
  610. up->pending = AF_INET;
  611. do_append_data:
  612. up->len += ulen;
  613. getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag;
  614. err = ip_append_data(sk, getfrag, msg->msg_iov, ulen,
  615. sizeof(struct udphdr), &ipc, rt,
  616. corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags);
  617. if (err)
  618. udp_flush_pending_frames(sk);
  619. else if (!corkreq)
  620. err = udp_push_pending_frames(sk);
  621. else if (unlikely(skb_queue_empty(&sk->sk_write_queue)))
  622. up->pending = 0;
  623. release_sock(sk);
  624. out:
  625. ip_rt_put(rt);
  626. if (free)
  627. kfree(ipc.opt);
  628. if (!err)
  629. return len;
  630. /*
  631. * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
  632. * ENOBUFS might not be good (it's not tunable per se), but otherwise
  633. * we don't have a good statistic (IpOutDiscards but it can be too many
  634. * things). We could add another new stat but at least for now that
  635. * seems like overkill.
  636. */
  637. if (err == -ENOBUFS || test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
  638. UDP_INC_STATS_USER(UDP_MIB_SNDBUFERRORS, is_udplite);
  639. }
  640. return err;
  641. do_confirm:
  642. dst_confirm(&rt->u.dst);
  643. if (!(msg->msg_flags&MSG_PROBE) || len)
  644. goto back_from_confirm;
  645. err = 0;
  646. goto out;
  647. }
  648. int udp_sendpage(struct sock *sk, struct page *page, int offset,
  649. size_t size, int flags)
  650. {
  651. struct udp_sock *up = udp_sk(sk);
  652. int ret;
  653. if (!up->pending) {
  654. struct msghdr msg = { .msg_flags = flags|MSG_MORE };
  655. /* Call udp_sendmsg to specify destination address which
  656. * sendpage interface can't pass.
  657. * This will succeed only when the socket is connected.
  658. */
  659. ret = udp_sendmsg(NULL, sk, &msg, 0);
  660. if (ret < 0)
  661. return ret;
  662. }
  663. lock_sock(sk);
  664. if (unlikely(!up->pending)) {
  665. release_sock(sk);
  666. LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 3\n");
  667. return -EINVAL;
  668. }
  669. ret = ip_append_page(sk, page, offset, size, flags);
  670. if (ret == -EOPNOTSUPP) {
  671. release_sock(sk);
  672. return sock_no_sendpage(sk->sk_socket, page, offset,
  673. size, flags);
  674. }
  675. if (ret < 0) {
  676. udp_flush_pending_frames(sk);
  677. goto out;
  678. }
  679. up->len += size;
  680. if (!(up->corkflag || (flags&MSG_MORE)))
  681. ret = udp_push_pending_frames(sk);
  682. if (!ret)
  683. ret = size;
  684. out:
  685. release_sock(sk);
  686. return ret;
  687. }
  688. /*
  689. * IOCTL requests applicable to the UDP protocol
  690. */
  691. int udp_ioctl(struct sock *sk, int cmd, unsigned long arg)
  692. {
  693. switch (cmd) {
  694. case SIOCOUTQ:
  695. {
  696. int amount = atomic_read(&sk->sk_wmem_alloc);
  697. return put_user(amount, (int __user *)arg);
  698. }
  699. case SIOCINQ:
  700. {
  701. struct sk_buff *skb;
  702. unsigned long amount;
  703. amount = 0;
  704. spin_lock_bh(&sk->sk_receive_queue.lock);
  705. skb = skb_peek(&sk->sk_receive_queue);
  706. if (skb != NULL) {
  707. /*
  708. * We will only return the amount
  709. * of this packet since that is all
  710. * that will be read.
  711. */
  712. amount = skb->len - sizeof(struct udphdr);
  713. }
  714. spin_unlock_bh(&sk->sk_receive_queue.lock);
  715. return put_user(amount, (int __user *)arg);
  716. }
  717. default:
  718. return -ENOIOCTLCMD;
  719. }
  720. return 0;
  721. }
  722. /*
  723. * This should be easy, if there is something there we
  724. * return it, otherwise we block.
  725. */
  726. int udp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
  727. size_t len, int noblock, int flags, int *addr_len)
  728. {
  729. struct inet_sock *inet = inet_sk(sk);
  730. struct sockaddr_in *sin = (struct sockaddr_in *)msg->msg_name;
  731. struct sk_buff *skb;
  732. unsigned int ulen, copied;
  733. int err;
  734. int is_udplite = IS_UDPLITE(sk);
  735. /*
  736. * Check any passed addresses
  737. */
  738. if (addr_len)
  739. *addr_len=sizeof(*sin);
  740. if (flags & MSG_ERRQUEUE)
  741. return ip_recv_error(sk, msg, len);
  742. try_again:
  743. skb = skb_recv_datagram(sk, flags, noblock, &err);
  744. if (!skb)
  745. goto out;
  746. ulen = skb->len - sizeof(struct udphdr);
  747. copied = len;
  748. if (copied > ulen)
  749. copied = ulen;
  750. else if (copied < ulen)
  751. msg->msg_flags |= MSG_TRUNC;
  752. /*
  753. * If checksum is needed at all, try to do it while copying the
  754. * data. If the data is truncated, or if we only want a partial
  755. * coverage checksum (UDP-Lite), do it before the copy.
  756. */
  757. if (copied < ulen || UDP_SKB_CB(skb)->partial_cov) {
  758. if (udp_lib_checksum_complete(skb))
  759. goto csum_copy_err;
  760. }
  761. if (skb_csum_unnecessary(skb))
  762. err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr),
  763. msg->msg_iov, copied );
  764. else {
  765. err = skb_copy_and_csum_datagram_iovec(skb, sizeof(struct udphdr), msg->msg_iov);
  766. if (err == -EINVAL)
  767. goto csum_copy_err;
  768. }
  769. if (err)
  770. goto out_free;
  771. sock_recv_timestamp(msg, sk, skb);
  772. /* Copy the address. */
  773. if (sin)
  774. {
  775. sin->sin_family = AF_INET;
  776. sin->sin_port = udp_hdr(skb)->source;
  777. sin->sin_addr.s_addr = ip_hdr(skb)->saddr;
  778. memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
  779. }
  780. if (inet->cmsg_flags)
  781. ip_cmsg_recv(msg, skb);
  782. err = copied;
  783. if (flags & MSG_TRUNC)
  784. err = ulen;
  785. out_free:
  786. skb_free_datagram(sk, skb);
  787. out:
  788. return err;
  789. csum_copy_err:
  790. UDP_INC_STATS_BH(UDP_MIB_INERRORS, is_udplite);
  791. skb_kill_datagram(sk, skb, flags);
  792. if (noblock)
  793. return -EAGAIN;
  794. goto try_again;
  795. }
  796. int udp_disconnect(struct sock *sk, int flags)
  797. {
  798. struct inet_sock *inet = inet_sk(sk);
  799. /*
  800. * 1003.1g - break association.
  801. */
  802. sk->sk_state = TCP_CLOSE;
  803. inet->daddr = 0;
  804. inet->dport = 0;
  805. sk->sk_bound_dev_if = 0;
  806. if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
  807. inet_reset_saddr(sk);
  808. if (!(sk->sk_userlocks & SOCK_BINDPORT_LOCK)) {
  809. sk->sk_prot->unhash(sk);
  810. inet->sport = 0;
  811. }
  812. sk_dst_reset(sk);
  813. return 0;
  814. }
  815. /* returns:
  816. * -1: error
  817. * 0: success
  818. * >0: "udp encap" protocol resubmission
  819. *
  820. * Note that in the success and error cases, the skb is assumed to
  821. * have either been requeued or freed.
  822. */
  823. int udp_queue_rcv_skb(struct sock * sk, struct sk_buff *skb)
  824. {
  825. struct udp_sock *up = udp_sk(sk);
  826. int rc;
  827. /*
  828. * Charge it to the socket, dropping if the queue is full.
  829. */
  830. if (!xfrm4_policy_check(sk, XFRM_POLICY_IN, skb))
  831. goto drop;
  832. nf_reset(skb);
  833. if (up->encap_type) {
  834. /*
  835. * This is an encapsulation socket so pass the skb to
  836. * the socket's udp_encap_rcv() hook. Otherwise, just
  837. * fall through and pass this up the UDP socket.
  838. * up->encap_rcv() returns the following value:
  839. * =0 if skb was successfully passed to the encap
  840. * handler or was discarded by it.
  841. * >0 if skb should be passed on to UDP.
  842. * <0 if skb should be resubmitted as proto -N
  843. */
  844. /* if we're overly short, let UDP handle it */
  845. if (skb->len > sizeof(struct udphdr) &&
  846. up->encap_rcv != NULL) {
  847. int ret;
  848. ret = (*up->encap_rcv)(sk, skb);
  849. if (ret <= 0) {
  850. UDP_INC_STATS_BH(UDP_MIB_INDATAGRAMS, up->pcflag);
  851. return -ret;
  852. }
  853. }
  854. /* FALLTHROUGH -- it's a UDP Packet */
  855. }
  856. /*
  857. * UDP-Lite specific tests, ignored on UDP sockets
  858. */
  859. if ((up->pcflag & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) {
  860. /*
  861. * MIB statistics other than incrementing the error count are
  862. * disabled for the following two types of errors: these depend
  863. * on the application settings, not on the functioning of the
  864. * protocol stack as such.
  865. *
  866. * RFC 3828 here recommends (sec 3.3): "There should also be a
  867. * way ... to ... at least let the receiving application block
  868. * delivery of packets with coverage values less than a value
  869. * provided by the application."
  870. */
  871. if (up->pcrlen == 0) { /* full coverage was set */
  872. LIMIT_NETDEBUG(KERN_WARNING "UDPLITE: partial coverage "
  873. "%d while full coverage %d requested\n",
  874. UDP_SKB_CB(skb)->cscov, skb->len);
  875. goto drop;
  876. }
  877. /* The next case involves violating the min. coverage requested
  878. * by the receiver. This is subtle: if receiver wants x and x is
  879. * greater than the buffersize/MTU then receiver will complain
  880. * that it wants x while sender emits packets of smaller size y.
  881. * Therefore the above ...()->partial_cov statement is essential.
  882. */
  883. if (UDP_SKB_CB(skb)->cscov < up->pcrlen) {
  884. LIMIT_NETDEBUG(KERN_WARNING
  885. "UDPLITE: coverage %d too small, need min %d\n",
  886. UDP_SKB_CB(skb)->cscov, up->pcrlen);
  887. goto drop;
  888. }
  889. }
  890. if (sk->sk_filter) {
  891. if (udp_lib_checksum_complete(skb))
  892. goto drop;
  893. }
  894. if ((rc = sock_queue_rcv_skb(sk,skb)) < 0) {
  895. /* Note that an ENOMEM error is charged twice */
  896. if (rc == -ENOMEM)
  897. UDP_INC_STATS_BH(UDP_MIB_RCVBUFERRORS, up->pcflag);
  898. goto drop;
  899. }
  900. UDP_INC_STATS_BH(UDP_MIB_INDATAGRAMS, up->pcflag);
  901. return 0;
  902. drop:
  903. UDP_INC_STATS_BH(UDP_MIB_INERRORS, up->pcflag);
  904. kfree_skb(skb);
  905. return -1;
  906. }
  907. /*
  908. * Multicasts and broadcasts go to each listener.
  909. *
  910. * Note: called only from the BH handler context,
  911. * so we don't need to lock the hashes.
  912. */
  913. static int __udp4_lib_mcast_deliver(struct sk_buff *skb,
  914. struct udphdr *uh,
  915. __be32 saddr, __be32 daddr,
  916. struct hlist_head udptable[])
  917. {
  918. struct sock *sk;
  919. int dif;
  920. read_lock(&udp_hash_lock);
  921. sk = sk_head(&udptable[ntohs(uh->dest) & (UDP_HTABLE_SIZE - 1)]);
  922. dif = skb->dev->ifindex;
  923. sk = udp_v4_mcast_next(sk, uh->dest, daddr, uh->source, saddr, dif);
  924. if (sk) {
  925. struct sock *sknext = NULL;
  926. do {
  927. struct sk_buff *skb1 = skb;
  928. sknext = udp_v4_mcast_next(sk_next(sk), uh->dest, daddr,
  929. uh->source, saddr, dif);
  930. if (sknext)
  931. skb1 = skb_clone(skb, GFP_ATOMIC);
  932. if (skb1) {
  933. int ret = udp_queue_rcv_skb(sk, skb1);
  934. if (ret > 0)
  935. /* we should probably re-process instead
  936. * of dropping packets here. */
  937. kfree_skb(skb1);
  938. }
  939. sk = sknext;
  940. } while (sknext);
  941. } else
  942. kfree_skb(skb);
  943. read_unlock(&udp_hash_lock);
  944. return 0;
  945. }
  946. /* Initialize UDP checksum. If exited with zero value (success),
  947. * CHECKSUM_UNNECESSARY means, that no more checks are required.
  948. * Otherwise, csum completion requires chacksumming packet body,
  949. * including udp header and folding it to skb->csum.
  950. */
  951. static inline int udp4_csum_init(struct sk_buff *skb, struct udphdr *uh,
  952. int proto)
  953. {
  954. const struct iphdr *iph;
  955. int err;
  956. UDP_SKB_CB(skb)->partial_cov = 0;
  957. UDP_SKB_CB(skb)->cscov = skb->len;
  958. if (proto == IPPROTO_UDPLITE) {
  959. err = udplite_checksum_init(skb, uh);
  960. if (err)
  961. return err;
  962. }
  963. iph = ip_hdr(skb);
  964. if (uh->check == 0) {
  965. skb->ip_summed = CHECKSUM_UNNECESSARY;
  966. } else if (skb->ip_summed == CHECKSUM_COMPLETE) {
  967. if (!csum_tcpudp_magic(iph->saddr, iph->daddr, skb->len,
  968. proto, skb->csum))
  969. skb->ip_summed = CHECKSUM_UNNECESSARY;
  970. }
  971. if (!skb_csum_unnecessary(skb))
  972. skb->csum = csum_tcpudp_nofold(iph->saddr, iph->daddr,
  973. skb->len, proto, 0);
  974. /* Probably, we should checksum udp header (it should be in cache
  975. * in any case) and data in tiny packets (< rx copybreak).
  976. */
  977. return 0;
  978. }
  979. /*
  980. * All we need to do is get the socket, and then do a checksum.
  981. */
  982. int __udp4_lib_rcv(struct sk_buff *skb, struct hlist_head udptable[],
  983. int proto)
  984. {
  985. struct sock *sk;
  986. struct udphdr *uh = udp_hdr(skb);
  987. unsigned short ulen;
  988. struct rtable *rt = (struct rtable*)skb->dst;
  989. __be32 saddr = ip_hdr(skb)->saddr;
  990. __be32 daddr = ip_hdr(skb)->daddr;
  991. /*
  992. * Validate the packet.
  993. */
  994. if (!pskb_may_pull(skb, sizeof(struct udphdr)))
  995. goto drop; /* No space for header. */
  996. ulen = ntohs(uh->len);
  997. if (ulen > skb->len)
  998. goto short_packet;
  999. if (proto == IPPROTO_UDP) {
  1000. /* UDP validates ulen. */
  1001. if (ulen < sizeof(*uh) || pskb_trim_rcsum(skb, ulen))
  1002. goto short_packet;
  1003. uh = udp_hdr(skb);
  1004. }
  1005. if (udp4_csum_init(skb, uh, proto))
  1006. goto csum_error;
  1007. if (rt->rt_flags & (RTCF_BROADCAST|RTCF_MULTICAST))
  1008. return __udp4_lib_mcast_deliver(skb, uh, saddr, daddr, udptable);
  1009. sk = __udp4_lib_lookup(saddr, uh->source, daddr, uh->dest,
  1010. inet_iif(skb), udptable);
  1011. if (sk != NULL) {
  1012. int ret = udp_queue_rcv_skb(sk, skb);
  1013. sock_put(sk);
  1014. /* a return value > 0 means to resubmit the input, but
  1015. * it wants the return to be -protocol, or 0
  1016. */
  1017. if (ret > 0)
  1018. return -ret;
  1019. return 0;
  1020. }
  1021. if (!xfrm4_policy_check(NULL, XFRM_POLICY_IN, skb))
  1022. goto drop;
  1023. nf_reset(skb);
  1024. /* No socket. Drop packet silently, if checksum is wrong */
  1025. if (udp_lib_checksum_complete(skb))
  1026. goto csum_error;
  1027. UDP_INC_STATS_BH(UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE);
  1028. icmp_send(skb, ICMP_DEST_UNREACH, ICMP_PORT_UNREACH, 0);
  1029. /*
  1030. * Hmm. We got an UDP packet to a port to which we
  1031. * don't wanna listen. Ignore it.
  1032. */
  1033. kfree_skb(skb);
  1034. return 0;
  1035. short_packet:
  1036. LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: short packet: From %u.%u.%u.%u:%u %d/%d to %u.%u.%u.%u:%u\n",
  1037. proto == IPPROTO_UDPLITE ? "-Lite" : "",
  1038. NIPQUAD(saddr),
  1039. ntohs(uh->source),
  1040. ulen,
  1041. skb->len,
  1042. NIPQUAD(daddr),
  1043. ntohs(uh->dest));
  1044. goto drop;
  1045. csum_error:
  1046. /*
  1047. * RFC1122: OK. Discards the bad packet silently (as far as
  1048. * the network is concerned, anyway) as per 4.1.3.4 (MUST).
  1049. */
  1050. LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: bad checksum. From %d.%d.%d.%d:%d to %d.%d.%d.%d:%d ulen %d\n",
  1051. proto == IPPROTO_UDPLITE ? "-Lite" : "",
  1052. NIPQUAD(saddr),
  1053. ntohs(uh->source),
  1054. NIPQUAD(daddr),
  1055. ntohs(uh->dest),
  1056. ulen);
  1057. drop:
  1058. UDP_INC_STATS_BH(UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE);
  1059. kfree_skb(skb);
  1060. return 0;
  1061. }
  1062. int udp_rcv(struct sk_buff *skb)
  1063. {
  1064. return __udp4_lib_rcv(skb, udp_hash, IPPROTO_UDP);
  1065. }
  1066. int udp_destroy_sock(struct sock *sk)
  1067. {
  1068. lock_sock(sk);
  1069. udp_flush_pending_frames(sk);
  1070. release_sock(sk);
  1071. return 0;
  1072. }
  1073. /*
  1074. * Socket option code for UDP
  1075. */
  1076. int udp_lib_setsockopt(struct sock *sk, int level, int optname,
  1077. char __user *optval, int optlen,
  1078. int (*push_pending_frames)(struct sock *))
  1079. {
  1080. struct udp_sock *up = udp_sk(sk);
  1081. int val;
  1082. int err = 0;
  1083. if (optlen<sizeof(int))
  1084. return -EINVAL;
  1085. if (get_user(val, (int __user *)optval))
  1086. return -EFAULT;
  1087. switch (optname) {
  1088. case UDP_CORK:
  1089. if (val != 0) {
  1090. up->corkflag = 1;
  1091. } else {
  1092. up->corkflag = 0;
  1093. lock_sock(sk);
  1094. (*push_pending_frames)(sk);
  1095. release_sock(sk);
  1096. }
  1097. break;
  1098. case UDP_ENCAP:
  1099. switch (val) {
  1100. case 0:
  1101. case UDP_ENCAP_ESPINUDP:
  1102. case UDP_ENCAP_ESPINUDP_NON_IKE:
  1103. up->encap_rcv = xfrm4_udp_encap_rcv;
  1104. /* FALLTHROUGH */
  1105. case UDP_ENCAP_L2TPINUDP:
  1106. up->encap_type = val;
  1107. break;
  1108. default:
  1109. err = -ENOPROTOOPT;
  1110. break;
  1111. }
  1112. break;
  1113. /*
  1114. * UDP-Lite's partial checksum coverage (RFC 3828).
  1115. */
  1116. /* The sender sets actual checksum coverage length via this option.
  1117. * The case coverage > packet length is handled by send module. */
  1118. case UDPLITE_SEND_CSCOV:
  1119. if (!up->pcflag) /* Disable the option on UDP sockets */
  1120. return -ENOPROTOOPT;
  1121. if (val != 0 && val < 8) /* Illegal coverage: use default (8) */
  1122. val = 8;
  1123. up->pcslen = val;
  1124. up->pcflag |= UDPLITE_SEND_CC;
  1125. break;
  1126. /* The receiver specifies a minimum checksum coverage value. To make
  1127. * sense, this should be set to at least 8 (as done below). If zero is
  1128. * used, this again means full checksum coverage. */
  1129. case UDPLITE_RECV_CSCOV:
  1130. if (!up->pcflag) /* Disable the option on UDP sockets */
  1131. return -ENOPROTOOPT;
  1132. if (val != 0 && val < 8) /* Avoid silly minimal values. */
  1133. val = 8;
  1134. up->pcrlen = val;
  1135. up->pcflag |= UDPLITE_RECV_CC;
  1136. break;
  1137. default:
  1138. err = -ENOPROTOOPT;
  1139. break;
  1140. }
  1141. return err;
  1142. }
  1143. int udp_setsockopt(struct sock *sk, int level, int optname,
  1144. char __user *optval, int optlen)
  1145. {
  1146. if (level == SOL_UDP || level == SOL_UDPLITE)
  1147. return udp_lib_setsockopt(sk, level, optname, optval, optlen,
  1148. udp_push_pending_frames);
  1149. return ip_setsockopt(sk, level, optname, optval, optlen);
  1150. }
  1151. #ifdef CONFIG_COMPAT
  1152. int compat_udp_setsockopt(struct sock *sk, int level, int optname,
  1153. char __user *optval, int optlen)
  1154. {
  1155. if (level == SOL_UDP || level == SOL_UDPLITE)
  1156. return udp_lib_setsockopt(sk, level, optname, optval, optlen,
  1157. udp_push_pending_frames);
  1158. return compat_ip_setsockopt(sk, level, optname, optval, optlen);
  1159. }
  1160. #endif
  1161. int udp_lib_getsockopt(struct sock *sk, int level, int optname,
  1162. char __user *optval, int __user *optlen)
  1163. {
  1164. struct udp_sock *up = udp_sk(sk);
  1165. int val, len;
  1166. if (get_user(len,optlen))
  1167. return -EFAULT;
  1168. len = min_t(unsigned int, len, sizeof(int));
  1169. if (len < 0)
  1170. return -EINVAL;
  1171. switch (optname) {
  1172. case UDP_CORK:
  1173. val = up->corkflag;
  1174. break;
  1175. case UDP_ENCAP:
  1176. val = up->encap_type;
  1177. break;
  1178. /* The following two cannot be changed on UDP sockets, the return is
  1179. * always 0 (which corresponds to the full checksum coverage of UDP). */
  1180. case UDPLITE_SEND_CSCOV:
  1181. val = up->pcslen;
  1182. break;
  1183. case UDPLITE_RECV_CSCOV:
  1184. val = up->pcrlen;
  1185. break;
  1186. default:
  1187. return -ENOPROTOOPT;
  1188. }
  1189. if (put_user(len, optlen))
  1190. return -EFAULT;
  1191. if (copy_to_user(optval, &val,len))
  1192. return -EFAULT;
  1193. return 0;
  1194. }
  1195. int udp_getsockopt(struct sock *sk, int level, int optname,
  1196. char __user *optval, int __user *optlen)
  1197. {
  1198. if (level == SOL_UDP || level == SOL_UDPLITE)
  1199. return udp_lib_getsockopt(sk, level, optname, optval, optlen);
  1200. return ip_getsockopt(sk, level, optname, optval, optlen);
  1201. }
  1202. #ifdef CONFIG_COMPAT
  1203. int compat_udp_getsockopt(struct sock *sk, int level, int optname,
  1204. char __user *optval, int __user *optlen)
  1205. {
  1206. if (level == SOL_UDP || level == SOL_UDPLITE)
  1207. return udp_lib_getsockopt(sk, level, optname, optval, optlen);
  1208. return compat_ip_getsockopt(sk, level, optname, optval, optlen);
  1209. }
  1210. #endif
  1211. /**
  1212. * udp_poll - wait for a UDP event.
  1213. * @file - file struct
  1214. * @sock - socket
  1215. * @wait - poll table
  1216. *
  1217. * This is same as datagram poll, except for the special case of
  1218. * blocking sockets. If application is using a blocking fd
  1219. * and a packet with checksum error is in the queue;
  1220. * then it could get return from select indicating data available
  1221. * but then block when reading it. Add special case code
  1222. * to work around these arguably broken applications.
  1223. */
  1224. unsigned int udp_poll(struct file *file, struct socket *sock, poll_table *wait)
  1225. {
  1226. unsigned int mask = datagram_poll(file, sock, wait);
  1227. struct sock *sk = sock->sk;
  1228. int is_lite = IS_UDPLITE(sk);
  1229. /* Check for false positives due to checksum errors */
  1230. if ( (mask & POLLRDNORM) &&
  1231. !(file->f_flags & O_NONBLOCK) &&
  1232. !(sk->sk_shutdown & RCV_SHUTDOWN)){
  1233. struct sk_buff_head *rcvq = &sk->sk_receive_queue;
  1234. struct sk_buff *skb;
  1235. spin_lock_bh(&rcvq->lock);
  1236. while ((skb = skb_peek(rcvq)) != NULL &&
  1237. udp_lib_checksum_complete(skb)) {
  1238. UDP_INC_STATS_BH(UDP_MIB_INERRORS, is_lite);
  1239. __skb_unlink(skb, rcvq);
  1240. kfree_skb(skb);
  1241. }
  1242. spin_unlock_bh(&rcvq->lock);
  1243. /* nothing to see, move along */
  1244. if (skb == NULL)
  1245. mask &= ~(POLLIN | POLLRDNORM);
  1246. }
  1247. return mask;
  1248. }
  1249. DEFINE_PROTO_INUSE(udp)
  1250. struct proto udp_prot = {
  1251. .name = "UDP",
  1252. .owner = THIS_MODULE,
  1253. .close = udp_lib_close,
  1254. .connect = ip4_datagram_connect,
  1255. .disconnect = udp_disconnect,
  1256. .ioctl = udp_ioctl,
  1257. .destroy = udp_destroy_sock,
  1258. .setsockopt = udp_setsockopt,
  1259. .getsockopt = udp_getsockopt,
  1260. .sendmsg = udp_sendmsg,
  1261. .recvmsg = udp_recvmsg,
  1262. .sendpage = udp_sendpage,
  1263. .backlog_rcv = udp_queue_rcv_skb,
  1264. .hash = udp_lib_hash,
  1265. .unhash = udp_lib_unhash,
  1266. .get_port = udp_v4_get_port,
  1267. .obj_size = sizeof(struct udp_sock),
  1268. #ifdef CONFIG_COMPAT
  1269. .compat_setsockopt = compat_udp_setsockopt,
  1270. .compat_getsockopt = compat_udp_getsockopt,
  1271. #endif
  1272. REF_PROTO_INUSE(udp)
  1273. };
  1274. /* ------------------------------------------------------------------------ */
  1275. #ifdef CONFIG_PROC_FS
  1276. static struct sock *udp_get_first(struct seq_file *seq)
  1277. {
  1278. struct sock *sk;
  1279. struct udp_iter_state *state = seq->private;
  1280. for (state->bucket = 0; state->bucket < UDP_HTABLE_SIZE; ++state->bucket) {
  1281. struct hlist_node *node;
  1282. sk_for_each(sk, node, state->hashtable + state->bucket) {
  1283. if (sk->sk_family == state->family)
  1284. goto found;
  1285. }
  1286. }
  1287. sk = NULL;
  1288. found:
  1289. return sk;
  1290. }
  1291. static struct sock *udp_get_next(struct seq_file *seq, struct sock *sk)
  1292. {
  1293. struct udp_iter_state *state = seq->private;
  1294. do {
  1295. sk = sk_next(sk);
  1296. try_again:
  1297. ;
  1298. } while (sk && sk->sk_family != state->family);
  1299. if (!sk && ++state->bucket < UDP_HTABLE_SIZE) {
  1300. sk = sk_head(state->hashtable + state->bucket);
  1301. goto try_again;
  1302. }
  1303. return sk;
  1304. }
  1305. static struct sock *udp_get_idx(struct seq_file *seq, loff_t pos)
  1306. {
  1307. struct sock *sk = udp_get_first(seq);
  1308. if (sk)
  1309. while (pos && (sk = udp_get_next(seq, sk)) != NULL)
  1310. --pos;
  1311. return pos ? NULL : sk;
  1312. }
  1313. static void *udp_seq_start(struct seq_file *seq, loff_t *pos)
  1314. {
  1315. read_lock(&udp_hash_lock);
  1316. return *pos ? udp_get_idx(seq, *pos-1) : (void *)1;
  1317. }
  1318. static void *udp_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  1319. {
  1320. struct sock *sk;
  1321. if (v == (void *)1)
  1322. sk = udp_get_idx(seq, 0);
  1323. else
  1324. sk = udp_get_next(seq, v);
  1325. ++*pos;
  1326. return sk;
  1327. }
  1328. static void udp_seq_stop(struct seq_file *seq, void *v)
  1329. {
  1330. read_unlock(&udp_hash_lock);
  1331. }
  1332. static int udp_seq_open(struct inode *inode, struct file *file)
  1333. {
  1334. struct udp_seq_afinfo *afinfo = PDE(inode)->data;
  1335. struct seq_file *seq;
  1336. int rc = -ENOMEM;
  1337. struct udp_iter_state *s = kzalloc(sizeof(*s), GFP_KERNEL);
  1338. if (!s)
  1339. goto out;
  1340. s->family = afinfo->family;
  1341. s->hashtable = afinfo->hashtable;
  1342. s->seq_ops.start = udp_seq_start;
  1343. s->seq_ops.next = udp_seq_next;
  1344. s->seq_ops.show = afinfo->seq_show;
  1345. s->seq_ops.stop = udp_seq_stop;
  1346. rc = seq_open(file, &s->seq_ops);
  1347. if (rc)
  1348. goto out_kfree;
  1349. seq = file->private_data;
  1350. seq->private = s;
  1351. out:
  1352. return rc;
  1353. out_kfree:
  1354. kfree(s);
  1355. goto out;
  1356. }
  1357. /* ------------------------------------------------------------------------ */
  1358. int udp_proc_register(struct udp_seq_afinfo *afinfo)
  1359. {
  1360. struct proc_dir_entry *p;
  1361. int rc = 0;
  1362. if (!afinfo)
  1363. return -EINVAL;
  1364. afinfo->seq_fops->owner = afinfo->owner;
  1365. afinfo->seq_fops->open = udp_seq_open;
  1366. afinfo->seq_fops->read = seq_read;
  1367. afinfo->seq_fops->llseek = seq_lseek;
  1368. afinfo->seq_fops->release = seq_release_private;
  1369. p = proc_net_fops_create(&init_net, afinfo->name, S_IRUGO, afinfo->seq_fops);
  1370. if (p)
  1371. p->data = afinfo;
  1372. else
  1373. rc = -ENOMEM;
  1374. return rc;
  1375. }
  1376. void udp_proc_unregister(struct udp_seq_afinfo *afinfo)
  1377. {
  1378. if (!afinfo)
  1379. return;
  1380. proc_net_remove(&init_net, afinfo->name);
  1381. memset(afinfo->seq_fops, 0, sizeof(*afinfo->seq_fops));
  1382. }
  1383. /* ------------------------------------------------------------------------ */
  1384. static void udp4_format_sock(struct sock *sp, char *tmpbuf, int bucket)
  1385. {
  1386. struct inet_sock *inet = inet_sk(sp);
  1387. __be32 dest = inet->daddr;
  1388. __be32 src = inet->rcv_saddr;
  1389. __u16 destp = ntohs(inet->dport);
  1390. __u16 srcp = ntohs(inet->sport);
  1391. sprintf(tmpbuf, "%4d: %08X:%04X %08X:%04X"
  1392. " %02X %08X:%08X %02X:%08lX %08X %5d %8d %lu %d %p",
  1393. bucket, src, srcp, dest, destp, sp->sk_state,
  1394. atomic_read(&sp->sk_wmem_alloc),
  1395. atomic_read(&sp->sk_rmem_alloc),
  1396. 0, 0L, 0, sock_i_uid(sp), 0, sock_i_ino(sp),
  1397. atomic_read(&sp->sk_refcnt), sp);
  1398. }
  1399. int udp4_seq_show(struct seq_file *seq, void *v)
  1400. {
  1401. if (v == SEQ_START_TOKEN)
  1402. seq_printf(seq, "%-127s\n",
  1403. " sl local_address rem_address st tx_queue "
  1404. "rx_queue tr tm->when retrnsmt uid timeout "
  1405. "inode");
  1406. else {
  1407. char tmpbuf[129];
  1408. struct udp_iter_state *state = seq->private;
  1409. udp4_format_sock(v, tmpbuf, state->bucket);
  1410. seq_printf(seq, "%-127s\n", tmpbuf);
  1411. }
  1412. return 0;
  1413. }
  1414. /* ------------------------------------------------------------------------ */
  1415. static struct file_operations udp4_seq_fops;
  1416. static struct udp_seq_afinfo udp4_seq_afinfo = {
  1417. .owner = THIS_MODULE,
  1418. .name = "udp",
  1419. .family = AF_INET,
  1420. .hashtable = udp_hash,
  1421. .seq_show = udp4_seq_show,
  1422. .seq_fops = &udp4_seq_fops,
  1423. };
  1424. int __init udp4_proc_init(void)
  1425. {
  1426. return udp_proc_register(&udp4_seq_afinfo);
  1427. }
  1428. void udp4_proc_exit(void)
  1429. {
  1430. udp_proc_unregister(&udp4_seq_afinfo);
  1431. }
  1432. #endif /* CONFIG_PROC_FS */
  1433. EXPORT_SYMBOL(udp_disconnect);
  1434. EXPORT_SYMBOL(udp_hash);
  1435. EXPORT_SYMBOL(udp_hash_lock);
  1436. EXPORT_SYMBOL(udp_ioctl);
  1437. EXPORT_SYMBOL(udp_get_port);
  1438. EXPORT_SYMBOL(udp_prot);
  1439. EXPORT_SYMBOL(udp_sendmsg);
  1440. EXPORT_SYMBOL(udp_lib_getsockopt);
  1441. EXPORT_SYMBOL(udp_lib_setsockopt);
  1442. EXPORT_SYMBOL(udp_poll);
  1443. #ifdef CONFIG_PROC_FS
  1444. EXPORT_SYMBOL(udp_proc_register);
  1445. EXPORT_SYMBOL(udp_proc_unregister);
  1446. #endif