udp.c 56 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243
  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. * Authors: Ross Biro
  9. * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
  10. * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
  11. * Alan Cox, <alan@lxorguk.ukuu.org.uk>
  12. * Hirokazu Takahashi, <taka@valinux.co.jp>
  13. *
  14. * Fixes:
  15. * Alan Cox : verify_area() calls
  16. * Alan Cox : stopped close while in use off icmp
  17. * messages. Not a fix but a botch that
  18. * for udp at least is 'valid'.
  19. * Alan Cox : Fixed icmp handling properly
  20. * Alan Cox : Correct error for oversized datagrams
  21. * Alan Cox : Tidied select() semantics.
  22. * Alan Cox : udp_err() fixed properly, also now
  23. * select and read wake correctly on errors
  24. * Alan Cox : udp_send verify_area moved to avoid mem leak
  25. * Alan Cox : UDP can count its memory
  26. * Alan Cox : send to an unknown connection causes
  27. * an ECONNREFUSED off the icmp, but
  28. * does NOT close.
  29. * Alan Cox : Switched to new sk_buff handlers. No more backlog!
  30. * Alan Cox : Using generic datagram code. Even smaller and the PEEK
  31. * bug no longer crashes it.
  32. * Fred Van Kempen : Net2e support for sk->broadcast.
  33. * Alan Cox : Uses skb_free_datagram
  34. * Alan Cox : Added get/set sockopt support.
  35. * Alan Cox : Broadcasting without option set returns EACCES.
  36. * Alan Cox : No wakeup calls. Instead we now use the callbacks.
  37. * Alan Cox : Use ip_tos and ip_ttl
  38. * Alan Cox : SNMP Mibs
  39. * Alan Cox : MSG_DONTROUTE, and 0.0.0.0 support.
  40. * Matt Dillon : UDP length checks.
  41. * Alan Cox : Smarter af_inet used properly.
  42. * Alan Cox : Use new kernel side addressing.
  43. * Alan Cox : Incorrect return on truncated datagram receive.
  44. * Arnt Gulbrandsen : New udp_send and stuff
  45. * Alan Cox : Cache last socket
  46. * Alan Cox : Route cache
  47. * Jon Peatfield : Minor efficiency fix to sendto().
  48. * Mike Shaver : RFC1122 checks.
  49. * Alan Cox : Nonblocking error fix.
  50. * Willy Konynenberg : Transparent proxying support.
  51. * Mike McLagan : Routing by source
  52. * David S. Miller : New socket lookup architecture.
  53. * Last socket cache retained as it
  54. * does have a high hit rate.
  55. * Olaf Kirch : Don't linearise iovec on sendmsg.
  56. * Andi Kleen : Some cleanups, cache destination entry
  57. * for connect.
  58. * Vitaly E. Lavrov : Transparent proxy revived after year coma.
  59. * Melvin Smith : Check msg_name not msg_namelen in sendto(),
  60. * return ENOTCONN for unconnected sockets (POSIX)
  61. * Janos Farkas : don't deliver multi/broadcasts to a different
  62. * bound-to-device socket
  63. * Hirokazu Takahashi : HW checksumming for outgoing UDP
  64. * datagrams.
  65. * Hirokazu Takahashi : sendfile() on UDP works now.
  66. * Arnaldo C. Melo : convert /proc/net/udp to seq_file
  67. * YOSHIFUJI Hideaki @USAGI and: Support IPV6_V6ONLY socket option, which
  68. * Alexey Kuznetsov: allow both IPv4 and IPv6 sockets to bind
  69. * a single port at the same time.
  70. * Derek Atkins <derek@ihtfp.com>: Add Encapulation Support
  71. * James Chapman : Add L2TP encapsulation type.
  72. *
  73. *
  74. * This program is free software; you can redistribute it and/or
  75. * modify it under the terms of the GNU General Public License
  76. * as published by the Free Software Foundation; either version
  77. * 2 of the License, or (at your option) any later version.
  78. */
  79. #include <asm/system.h>
  80. #include <asm/uaccess.h>
  81. #include <asm/ioctls.h>
  82. #include <linux/bootmem.h>
  83. #include <linux/highmem.h>
  84. #include <linux/swap.h>
  85. #include <linux/types.h>
  86. #include <linux/fcntl.h>
  87. #include <linux/module.h>
  88. #include <linux/socket.h>
  89. #include <linux/sockios.h>
  90. #include <linux/igmp.h>
  91. #include <linux/in.h>
  92. #include <linux/errno.h>
  93. #include <linux/timer.h>
  94. #include <linux/mm.h>
  95. #include <linux/inet.h>
  96. #include <linux/netdevice.h>
  97. #include <linux/slab.h>
  98. #include <net/tcp_states.h>
  99. #include <linux/skbuff.h>
  100. #include <linux/proc_fs.h>
  101. #include <linux/seq_file.h>
  102. #include <net/net_namespace.h>
  103. #include <net/icmp.h>
  104. #include <net/route.h>
  105. #include <net/checksum.h>
  106. #include <net/xfrm.h>
  107. #include "udp_impl.h"
  108. struct udp_table udp_table __read_mostly;
  109. EXPORT_SYMBOL(udp_table);
  110. long sysctl_udp_mem[3] __read_mostly;
  111. EXPORT_SYMBOL(sysctl_udp_mem);
  112. int sysctl_udp_rmem_min __read_mostly;
  113. EXPORT_SYMBOL(sysctl_udp_rmem_min);
  114. int sysctl_udp_wmem_min __read_mostly;
  115. EXPORT_SYMBOL(sysctl_udp_wmem_min);
  116. atomic_long_t udp_memory_allocated;
  117. EXPORT_SYMBOL(udp_memory_allocated);
  118. #define MAX_UDP_PORTS 65536
  119. #define PORTS_PER_CHAIN (MAX_UDP_PORTS / UDP_HTABLE_SIZE_MIN)
  120. static int udp_lib_lport_inuse(struct net *net, __u16 num,
  121. const struct udp_hslot *hslot,
  122. unsigned long *bitmap,
  123. struct sock *sk,
  124. int (*saddr_comp)(const struct sock *sk1,
  125. const struct sock *sk2),
  126. unsigned int log)
  127. {
  128. struct sock *sk2;
  129. struct hlist_nulls_node *node;
  130. sk_nulls_for_each(sk2, node, &hslot->head)
  131. if (net_eq(sock_net(sk2), net) &&
  132. sk2 != sk &&
  133. (bitmap || udp_sk(sk2)->udp_port_hash == num) &&
  134. (!sk2->sk_reuse || !sk->sk_reuse) &&
  135. (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if ||
  136. sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
  137. (*saddr_comp)(sk, sk2)) {
  138. if (bitmap)
  139. __set_bit(udp_sk(sk2)->udp_port_hash >> log,
  140. bitmap);
  141. else
  142. return 1;
  143. }
  144. return 0;
  145. }
  146. /*
  147. * Note: we still hold spinlock of primary hash chain, so no other writer
  148. * can insert/delete a socket with local_port == num
  149. */
  150. static int udp_lib_lport_inuse2(struct net *net, __u16 num,
  151. struct udp_hslot *hslot2,
  152. struct sock *sk,
  153. int (*saddr_comp)(const struct sock *sk1,
  154. const struct sock *sk2))
  155. {
  156. struct sock *sk2;
  157. struct hlist_nulls_node *node;
  158. int res = 0;
  159. spin_lock(&hslot2->lock);
  160. udp_portaddr_for_each_entry(sk2, node, &hslot2->head)
  161. if (net_eq(sock_net(sk2), net) &&
  162. sk2 != sk &&
  163. (udp_sk(sk2)->udp_port_hash == num) &&
  164. (!sk2->sk_reuse || !sk->sk_reuse) &&
  165. (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if ||
  166. sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
  167. (*saddr_comp)(sk, sk2)) {
  168. res = 1;
  169. break;
  170. }
  171. spin_unlock(&hslot2->lock);
  172. return res;
  173. }
  174. /**
  175. * udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
  176. *
  177. * @sk: socket struct in question
  178. * @snum: port number to look up
  179. * @saddr_comp: AF-dependent comparison of bound local IP addresses
  180. * @hash2_nulladdr: AF-dependant hash value in secondary hash chains,
  181. * with NULL address
  182. */
  183. int udp_lib_get_port(struct sock *sk, unsigned short snum,
  184. int (*saddr_comp)(const struct sock *sk1,
  185. const struct sock *sk2),
  186. unsigned int hash2_nulladdr)
  187. {
  188. struct udp_hslot *hslot, *hslot2;
  189. struct udp_table *udptable = sk->sk_prot->h.udp_table;
  190. int error = 1;
  191. struct net *net = sock_net(sk);
  192. if (!snum) {
  193. int low, high, remaining;
  194. unsigned rand;
  195. unsigned short first, last;
  196. DECLARE_BITMAP(bitmap, PORTS_PER_CHAIN);
  197. inet_get_local_port_range(&low, &high);
  198. remaining = (high - low) + 1;
  199. rand = net_random();
  200. first = (((u64)rand * remaining) >> 32) + low;
  201. /*
  202. * force rand to be an odd multiple of UDP_HTABLE_SIZE
  203. */
  204. rand = (rand | 1) * (udptable->mask + 1);
  205. last = first + udptable->mask + 1;
  206. do {
  207. hslot = udp_hashslot(udptable, net, first);
  208. bitmap_zero(bitmap, PORTS_PER_CHAIN);
  209. spin_lock_bh(&hslot->lock);
  210. udp_lib_lport_inuse(net, snum, hslot, bitmap, sk,
  211. saddr_comp, udptable->log);
  212. snum = first;
  213. /*
  214. * Iterate on all possible values of snum for this hash.
  215. * Using steps of an odd multiple of UDP_HTABLE_SIZE
  216. * give us randomization and full range coverage.
  217. */
  218. do {
  219. if (low <= snum && snum <= high &&
  220. !test_bit(snum >> udptable->log, bitmap) &&
  221. !inet_is_reserved_local_port(snum))
  222. goto found;
  223. snum += rand;
  224. } while (snum != first);
  225. spin_unlock_bh(&hslot->lock);
  226. } while (++first != last);
  227. goto fail;
  228. } else {
  229. hslot = udp_hashslot(udptable, net, snum);
  230. spin_lock_bh(&hslot->lock);
  231. if (hslot->count > 10) {
  232. int exist;
  233. unsigned int slot2 = udp_sk(sk)->udp_portaddr_hash ^ snum;
  234. slot2 &= udptable->mask;
  235. hash2_nulladdr &= udptable->mask;
  236. hslot2 = udp_hashslot2(udptable, slot2);
  237. if (hslot->count < hslot2->count)
  238. goto scan_primary_hash;
  239. exist = udp_lib_lport_inuse2(net, snum, hslot2,
  240. sk, saddr_comp);
  241. if (!exist && (hash2_nulladdr != slot2)) {
  242. hslot2 = udp_hashslot2(udptable, hash2_nulladdr);
  243. exist = udp_lib_lport_inuse2(net, snum, hslot2,
  244. sk, saddr_comp);
  245. }
  246. if (exist)
  247. goto fail_unlock;
  248. else
  249. goto found;
  250. }
  251. scan_primary_hash:
  252. if (udp_lib_lport_inuse(net, snum, hslot, NULL, sk,
  253. saddr_comp, 0))
  254. goto fail_unlock;
  255. }
  256. found:
  257. inet_sk(sk)->inet_num = snum;
  258. udp_sk(sk)->udp_port_hash = snum;
  259. udp_sk(sk)->udp_portaddr_hash ^= snum;
  260. if (sk_unhashed(sk)) {
  261. sk_nulls_add_node_rcu(sk, &hslot->head);
  262. hslot->count++;
  263. sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1);
  264. hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
  265. spin_lock(&hslot2->lock);
  266. hlist_nulls_add_head_rcu(&udp_sk(sk)->udp_portaddr_node,
  267. &hslot2->head);
  268. hslot2->count++;
  269. spin_unlock(&hslot2->lock);
  270. }
  271. error = 0;
  272. fail_unlock:
  273. spin_unlock_bh(&hslot->lock);
  274. fail:
  275. return error;
  276. }
  277. EXPORT_SYMBOL(udp_lib_get_port);
  278. static int ipv4_rcv_saddr_equal(const struct sock *sk1, const struct sock *sk2)
  279. {
  280. struct inet_sock *inet1 = inet_sk(sk1), *inet2 = inet_sk(sk2);
  281. return (!ipv6_only_sock(sk2) &&
  282. (!inet1->inet_rcv_saddr || !inet2->inet_rcv_saddr ||
  283. inet1->inet_rcv_saddr == inet2->inet_rcv_saddr));
  284. }
  285. static unsigned int udp4_portaddr_hash(struct net *net, __be32 saddr,
  286. unsigned int port)
  287. {
  288. return jhash_1word((__force u32)saddr, net_hash_mix(net)) ^ port;
  289. }
  290. int udp_v4_get_port(struct sock *sk, unsigned short snum)
  291. {
  292. unsigned int hash2_nulladdr =
  293. udp4_portaddr_hash(sock_net(sk), htonl(INADDR_ANY), snum);
  294. unsigned int hash2_partial =
  295. udp4_portaddr_hash(sock_net(sk), inet_sk(sk)->inet_rcv_saddr, 0);
  296. /* precompute partial secondary hash */
  297. udp_sk(sk)->udp_portaddr_hash = hash2_partial;
  298. return udp_lib_get_port(sk, snum, ipv4_rcv_saddr_equal, hash2_nulladdr);
  299. }
  300. static inline int compute_score(struct sock *sk, struct net *net, __be32 saddr,
  301. unsigned short hnum,
  302. __be16 sport, __be32 daddr, __be16 dport, int dif)
  303. {
  304. int score = -1;
  305. if (net_eq(sock_net(sk), net) && udp_sk(sk)->udp_port_hash == hnum &&
  306. !ipv6_only_sock(sk)) {
  307. struct inet_sock *inet = inet_sk(sk);
  308. score = (sk->sk_family == PF_INET ? 1 : 0);
  309. if (inet->inet_rcv_saddr) {
  310. if (inet->inet_rcv_saddr != daddr)
  311. return -1;
  312. score += 2;
  313. }
  314. if (inet->inet_daddr) {
  315. if (inet->inet_daddr != saddr)
  316. return -1;
  317. score += 2;
  318. }
  319. if (inet->inet_dport) {
  320. if (inet->inet_dport != sport)
  321. return -1;
  322. score += 2;
  323. }
  324. if (sk->sk_bound_dev_if) {
  325. if (sk->sk_bound_dev_if != dif)
  326. return -1;
  327. score += 2;
  328. }
  329. }
  330. return score;
  331. }
  332. /*
  333. * In this second variant, we check (daddr, dport) matches (inet_rcv_sadd, inet_num)
  334. */
  335. #define SCORE2_MAX (1 + 2 + 2 + 2)
  336. static inline int compute_score2(struct sock *sk, struct net *net,
  337. __be32 saddr, __be16 sport,
  338. __be32 daddr, unsigned int hnum, int dif)
  339. {
  340. int score = -1;
  341. if (net_eq(sock_net(sk), net) && !ipv6_only_sock(sk)) {
  342. struct inet_sock *inet = inet_sk(sk);
  343. if (inet->inet_rcv_saddr != daddr)
  344. return -1;
  345. if (inet->inet_num != hnum)
  346. return -1;
  347. score = (sk->sk_family == PF_INET ? 1 : 0);
  348. if (inet->inet_daddr) {
  349. if (inet->inet_daddr != saddr)
  350. return -1;
  351. score += 2;
  352. }
  353. if (inet->inet_dport) {
  354. if (inet->inet_dport != sport)
  355. return -1;
  356. score += 2;
  357. }
  358. if (sk->sk_bound_dev_if) {
  359. if (sk->sk_bound_dev_if != dif)
  360. return -1;
  361. score += 2;
  362. }
  363. }
  364. return score;
  365. }
  366. /* called with read_rcu_lock() */
  367. static struct sock *udp4_lib_lookup2(struct net *net,
  368. __be32 saddr, __be16 sport,
  369. __be32 daddr, unsigned int hnum, int dif,
  370. struct udp_hslot *hslot2, unsigned int slot2)
  371. {
  372. struct sock *sk, *result;
  373. struct hlist_nulls_node *node;
  374. int score, badness;
  375. begin:
  376. result = NULL;
  377. badness = -1;
  378. udp_portaddr_for_each_entry_rcu(sk, node, &hslot2->head) {
  379. score = compute_score2(sk, net, saddr, sport,
  380. daddr, hnum, dif);
  381. if (score > badness) {
  382. result = sk;
  383. badness = score;
  384. if (score == SCORE2_MAX)
  385. goto exact_match;
  386. }
  387. }
  388. /*
  389. * if the nulls value we got at the end of this lookup is
  390. * not the expected one, we must restart lookup.
  391. * We probably met an item that was moved to another chain.
  392. */
  393. if (get_nulls_value(node) != slot2)
  394. goto begin;
  395. if (result) {
  396. exact_match:
  397. if (unlikely(!atomic_inc_not_zero_hint(&result->sk_refcnt, 2)))
  398. result = NULL;
  399. else if (unlikely(compute_score2(result, net, saddr, sport,
  400. daddr, hnum, dif) < badness)) {
  401. sock_put(result);
  402. goto begin;
  403. }
  404. }
  405. return result;
  406. }
  407. /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
  408. * harder than this. -DaveM
  409. */
  410. static struct sock *__udp4_lib_lookup(struct net *net, __be32 saddr,
  411. __be16 sport, __be32 daddr, __be16 dport,
  412. int dif, struct udp_table *udptable)
  413. {
  414. struct sock *sk, *result;
  415. struct hlist_nulls_node *node;
  416. unsigned short hnum = ntohs(dport);
  417. unsigned int hash2, slot2, slot = udp_hashfn(net, hnum, udptable->mask);
  418. struct udp_hslot *hslot2, *hslot = &udptable->hash[slot];
  419. int score, badness;
  420. rcu_read_lock();
  421. if (hslot->count > 10) {
  422. hash2 = udp4_portaddr_hash(net, daddr, hnum);
  423. slot2 = hash2 & udptable->mask;
  424. hslot2 = &udptable->hash2[slot2];
  425. if (hslot->count < hslot2->count)
  426. goto begin;
  427. result = udp4_lib_lookup2(net, saddr, sport,
  428. daddr, hnum, dif,
  429. hslot2, slot2);
  430. if (!result) {
  431. hash2 = udp4_portaddr_hash(net, htonl(INADDR_ANY), hnum);
  432. slot2 = hash2 & udptable->mask;
  433. hslot2 = &udptable->hash2[slot2];
  434. if (hslot->count < hslot2->count)
  435. goto begin;
  436. result = udp4_lib_lookup2(net, saddr, sport,
  437. htonl(INADDR_ANY), hnum, dif,
  438. hslot2, slot2);
  439. }
  440. rcu_read_unlock();
  441. return result;
  442. }
  443. begin:
  444. result = NULL;
  445. badness = -1;
  446. sk_nulls_for_each_rcu(sk, node, &hslot->head) {
  447. score = compute_score(sk, net, saddr, hnum, sport,
  448. daddr, dport, dif);
  449. if (score > badness) {
  450. result = sk;
  451. badness = score;
  452. }
  453. }
  454. /*
  455. * if the nulls value we got at the end of this lookup is
  456. * not the expected one, we must restart lookup.
  457. * We probably met an item that was moved to another chain.
  458. */
  459. if (get_nulls_value(node) != slot)
  460. goto begin;
  461. if (result) {
  462. if (unlikely(!atomic_inc_not_zero_hint(&result->sk_refcnt, 2)))
  463. result = NULL;
  464. else if (unlikely(compute_score(result, net, saddr, hnum, sport,
  465. daddr, dport, dif) < badness)) {
  466. sock_put(result);
  467. goto begin;
  468. }
  469. }
  470. rcu_read_unlock();
  471. return result;
  472. }
  473. static inline struct sock *__udp4_lib_lookup_skb(struct sk_buff *skb,
  474. __be16 sport, __be16 dport,
  475. struct udp_table *udptable)
  476. {
  477. struct sock *sk;
  478. const struct iphdr *iph = ip_hdr(skb);
  479. if (unlikely(sk = skb_steal_sock(skb)))
  480. return sk;
  481. else
  482. return __udp4_lib_lookup(dev_net(skb_dst(skb)->dev), iph->saddr, sport,
  483. iph->daddr, dport, inet_iif(skb),
  484. udptable);
  485. }
  486. struct sock *udp4_lib_lookup(struct net *net, __be32 saddr, __be16 sport,
  487. __be32 daddr, __be16 dport, int dif)
  488. {
  489. return __udp4_lib_lookup(net, saddr, sport, daddr, dport, dif, &udp_table);
  490. }
  491. EXPORT_SYMBOL_GPL(udp4_lib_lookup);
  492. static inline struct sock *udp_v4_mcast_next(struct net *net, struct sock *sk,
  493. __be16 loc_port, __be32 loc_addr,
  494. __be16 rmt_port, __be32 rmt_addr,
  495. int dif)
  496. {
  497. struct hlist_nulls_node *node;
  498. struct sock *s = sk;
  499. unsigned short hnum = ntohs(loc_port);
  500. sk_nulls_for_each_from(s, node) {
  501. struct inet_sock *inet = inet_sk(s);
  502. if (!net_eq(sock_net(s), net) ||
  503. udp_sk(s)->udp_port_hash != hnum ||
  504. (inet->inet_daddr && inet->inet_daddr != rmt_addr) ||
  505. (inet->inet_dport != rmt_port && inet->inet_dport) ||
  506. (inet->inet_rcv_saddr &&
  507. inet->inet_rcv_saddr != loc_addr) ||
  508. ipv6_only_sock(s) ||
  509. (s->sk_bound_dev_if && s->sk_bound_dev_if != dif))
  510. continue;
  511. if (!ip_mc_sf_allow(s, loc_addr, rmt_addr, dif))
  512. continue;
  513. goto found;
  514. }
  515. s = NULL;
  516. found:
  517. return s;
  518. }
  519. /*
  520. * This routine is called by the ICMP module when it gets some
  521. * sort of error condition. If err < 0 then the socket should
  522. * be closed and the error returned to the user. If err > 0
  523. * it's just the icmp type << 8 | icmp code.
  524. * Header points to the ip header of the error packet. We move
  525. * on past this. Then (as it used to claim before adjustment)
  526. * header points to the first 8 bytes of the udp header. We need
  527. * to find the appropriate port.
  528. */
  529. void __udp4_lib_err(struct sk_buff *skb, u32 info, struct udp_table *udptable)
  530. {
  531. struct inet_sock *inet;
  532. struct iphdr *iph = (struct iphdr *)skb->data;
  533. struct udphdr *uh = (struct udphdr *)(skb->data+(iph->ihl<<2));
  534. const int type = icmp_hdr(skb)->type;
  535. const int code = icmp_hdr(skb)->code;
  536. struct sock *sk;
  537. int harderr;
  538. int err;
  539. struct net *net = dev_net(skb->dev);
  540. sk = __udp4_lib_lookup(net, iph->daddr, uh->dest,
  541. iph->saddr, uh->source, skb->dev->ifindex, udptable);
  542. if (sk == NULL) {
  543. ICMP_INC_STATS_BH(net, ICMP_MIB_INERRORS);
  544. return; /* No socket for error */
  545. }
  546. err = 0;
  547. harderr = 0;
  548. inet = inet_sk(sk);
  549. switch (type) {
  550. default:
  551. case ICMP_TIME_EXCEEDED:
  552. err = EHOSTUNREACH;
  553. break;
  554. case ICMP_SOURCE_QUENCH:
  555. goto out;
  556. case ICMP_PARAMETERPROB:
  557. err = EPROTO;
  558. harderr = 1;
  559. break;
  560. case ICMP_DEST_UNREACH:
  561. if (code == ICMP_FRAG_NEEDED) { /* Path MTU discovery */
  562. if (inet->pmtudisc != IP_PMTUDISC_DONT) {
  563. err = EMSGSIZE;
  564. harderr = 1;
  565. break;
  566. }
  567. goto out;
  568. }
  569. err = EHOSTUNREACH;
  570. if (code <= NR_ICMP_UNREACH) {
  571. harderr = icmp_err_convert[code].fatal;
  572. err = icmp_err_convert[code].errno;
  573. }
  574. break;
  575. }
  576. /*
  577. * RFC1122: OK. Passes ICMP errors back to application, as per
  578. * 4.1.3.3.
  579. */
  580. if (!inet->recverr) {
  581. if (!harderr || sk->sk_state != TCP_ESTABLISHED)
  582. goto out;
  583. } else
  584. ip_icmp_error(sk, skb, err, uh->dest, info, (u8 *)(uh+1));
  585. sk->sk_err = err;
  586. sk->sk_error_report(sk);
  587. out:
  588. sock_put(sk);
  589. }
  590. void udp_err(struct sk_buff *skb, u32 info)
  591. {
  592. __udp4_lib_err(skb, info, &udp_table);
  593. }
  594. /*
  595. * Throw away all pending data and cancel the corking. Socket is locked.
  596. */
  597. void udp_flush_pending_frames(struct sock *sk)
  598. {
  599. struct udp_sock *up = udp_sk(sk);
  600. if (up->pending) {
  601. up->len = 0;
  602. up->pending = 0;
  603. ip_flush_pending_frames(sk);
  604. }
  605. }
  606. EXPORT_SYMBOL(udp_flush_pending_frames);
  607. /**
  608. * udp4_hwcsum_outgoing - handle outgoing HW checksumming
  609. * @sk: socket we are sending on
  610. * @skb: sk_buff containing the filled-in UDP header
  611. * (checksum field must be zeroed out)
  612. */
  613. static void udp4_hwcsum_outgoing(struct sock *sk, struct sk_buff *skb,
  614. __be32 src, __be32 dst, int len)
  615. {
  616. unsigned int offset;
  617. struct udphdr *uh = udp_hdr(skb);
  618. __wsum csum = 0;
  619. if (skb_queue_len(&sk->sk_write_queue) == 1) {
  620. /*
  621. * Only one fragment on the socket.
  622. */
  623. skb->csum_start = skb_transport_header(skb) - skb->head;
  624. skb->csum_offset = offsetof(struct udphdr, check);
  625. uh->check = ~csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, 0);
  626. } else {
  627. /*
  628. * HW-checksum won't work as there are two or more
  629. * fragments on the socket so that all csums of sk_buffs
  630. * should be together
  631. */
  632. offset = skb_transport_offset(skb);
  633. skb->csum = skb_checksum(skb, offset, skb->len - offset, 0);
  634. skb->ip_summed = CHECKSUM_NONE;
  635. skb_queue_walk(&sk->sk_write_queue, skb) {
  636. csum = csum_add(csum, skb->csum);
  637. }
  638. uh->check = csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, csum);
  639. if (uh->check == 0)
  640. uh->check = CSUM_MANGLED_0;
  641. }
  642. }
  643. /*
  644. * Push out all pending data as one UDP datagram. Socket is locked.
  645. */
  646. static int udp_push_pending_frames(struct sock *sk)
  647. {
  648. struct udp_sock *up = udp_sk(sk);
  649. struct inet_sock *inet = inet_sk(sk);
  650. struct flowi *fl = &inet->cork.fl;
  651. struct sk_buff *skb;
  652. struct udphdr *uh;
  653. int err = 0;
  654. int is_udplite = IS_UDPLITE(sk);
  655. __wsum csum = 0;
  656. /* Grab the skbuff where UDP header space exists. */
  657. if ((skb = skb_peek(&sk->sk_write_queue)) == NULL)
  658. goto out;
  659. /*
  660. * Create a UDP header
  661. */
  662. uh = udp_hdr(skb);
  663. uh->source = fl->fl_ip_sport;
  664. uh->dest = fl->fl_ip_dport;
  665. uh->len = htons(up->len);
  666. uh->check = 0;
  667. if (is_udplite) /* UDP-Lite */
  668. csum = udplite_csum_outgoing(sk, skb);
  669. else if (sk->sk_no_check == UDP_CSUM_NOXMIT) { /* UDP csum disabled */
  670. skb->ip_summed = CHECKSUM_NONE;
  671. goto send;
  672. } else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */
  673. udp4_hwcsum_outgoing(sk, skb, fl->fl4_src, fl->fl4_dst, up->len);
  674. goto send;
  675. } else /* `normal' UDP */
  676. csum = udp_csum_outgoing(sk, skb);
  677. /* add protocol-dependent pseudo-header */
  678. uh->check = csum_tcpudp_magic(fl->fl4_src, fl->fl4_dst, up->len,
  679. sk->sk_protocol, csum);
  680. if (uh->check == 0)
  681. uh->check = CSUM_MANGLED_0;
  682. send:
  683. err = ip_push_pending_frames(sk);
  684. if (err) {
  685. if (err == -ENOBUFS && !inet->recverr) {
  686. UDP_INC_STATS_USER(sock_net(sk),
  687. UDP_MIB_SNDBUFERRORS, is_udplite);
  688. err = 0;
  689. }
  690. } else
  691. UDP_INC_STATS_USER(sock_net(sk),
  692. UDP_MIB_OUTDATAGRAMS, is_udplite);
  693. out:
  694. up->len = 0;
  695. up->pending = 0;
  696. return err;
  697. }
  698. int udp_sendmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
  699. size_t len)
  700. {
  701. struct inet_sock *inet = inet_sk(sk);
  702. struct udp_sock *up = udp_sk(sk);
  703. int ulen = len;
  704. struct ipcm_cookie ipc;
  705. struct rtable *rt = NULL;
  706. int free = 0;
  707. int connected = 0;
  708. __be32 daddr, faddr, saddr;
  709. __be16 dport;
  710. u8 tos;
  711. int err, is_udplite = IS_UDPLITE(sk);
  712. int corkreq = up->corkflag || msg->msg_flags&MSG_MORE;
  713. int (*getfrag)(void *, char *, int, int, int, struct sk_buff *);
  714. if (len > 0xFFFF)
  715. return -EMSGSIZE;
  716. /*
  717. * Check the flags.
  718. */
  719. if (msg->msg_flags & MSG_OOB) /* Mirror BSD error message compatibility */
  720. return -EOPNOTSUPP;
  721. ipc.opt = NULL;
  722. ipc.tx_flags = 0;
  723. if (up->pending) {
  724. /*
  725. * There are pending frames.
  726. * The socket lock must be held while it's corked.
  727. */
  728. lock_sock(sk);
  729. if (likely(up->pending)) {
  730. if (unlikely(up->pending != AF_INET)) {
  731. release_sock(sk);
  732. return -EINVAL;
  733. }
  734. goto do_append_data;
  735. }
  736. release_sock(sk);
  737. }
  738. ulen += sizeof(struct udphdr);
  739. /*
  740. * Get and verify the address.
  741. */
  742. if (msg->msg_name) {
  743. struct sockaddr_in * usin = (struct sockaddr_in *)msg->msg_name;
  744. if (msg->msg_namelen < sizeof(*usin))
  745. return -EINVAL;
  746. if (usin->sin_family != AF_INET) {
  747. if (usin->sin_family != AF_UNSPEC)
  748. return -EAFNOSUPPORT;
  749. }
  750. daddr = usin->sin_addr.s_addr;
  751. dport = usin->sin_port;
  752. if (dport == 0)
  753. return -EINVAL;
  754. } else {
  755. if (sk->sk_state != TCP_ESTABLISHED)
  756. return -EDESTADDRREQ;
  757. daddr = inet->inet_daddr;
  758. dport = inet->inet_dport;
  759. /* Open fast path for connected socket.
  760. Route will not be used, if at least one option is set.
  761. */
  762. connected = 1;
  763. }
  764. ipc.addr = inet->inet_saddr;
  765. ipc.oif = sk->sk_bound_dev_if;
  766. err = sock_tx_timestamp(sk, &ipc.tx_flags);
  767. if (err)
  768. return err;
  769. if (msg->msg_controllen) {
  770. err = ip_cmsg_send(sock_net(sk), msg, &ipc);
  771. if (err)
  772. return err;
  773. if (ipc.opt)
  774. free = 1;
  775. connected = 0;
  776. }
  777. if (!ipc.opt)
  778. ipc.opt = inet->opt;
  779. saddr = ipc.addr;
  780. ipc.addr = faddr = daddr;
  781. if (ipc.opt && ipc.opt->srr) {
  782. if (!daddr)
  783. return -EINVAL;
  784. faddr = ipc.opt->faddr;
  785. connected = 0;
  786. }
  787. tos = RT_TOS(inet->tos);
  788. if (sock_flag(sk, SOCK_LOCALROUTE) ||
  789. (msg->msg_flags & MSG_DONTROUTE) ||
  790. (ipc.opt && ipc.opt->is_strictroute)) {
  791. tos |= RTO_ONLINK;
  792. connected = 0;
  793. }
  794. if (ipv4_is_multicast(daddr)) {
  795. if (!ipc.oif)
  796. ipc.oif = inet->mc_index;
  797. if (!saddr)
  798. saddr = inet->mc_addr;
  799. connected = 0;
  800. }
  801. if (connected)
  802. rt = (struct rtable *)sk_dst_check(sk, 0);
  803. if (rt == NULL) {
  804. struct flowi fl = { .oif = ipc.oif,
  805. .mark = sk->sk_mark,
  806. .fl4_dst = faddr,
  807. .fl4_src = saddr,
  808. .fl4_tos = tos,
  809. .proto = sk->sk_protocol,
  810. .flags = inet_sk_flowi_flags(sk),
  811. .fl_ip_sport = inet->inet_sport,
  812. .fl_ip_dport = dport };
  813. struct net *net = sock_net(sk);
  814. security_sk_classify_flow(sk, &fl);
  815. err = ip_route_output_flow(net, &rt, &fl, sk, 1);
  816. if (err) {
  817. if (err == -ENETUNREACH)
  818. IP_INC_STATS_BH(net, IPSTATS_MIB_OUTNOROUTES);
  819. goto out;
  820. }
  821. err = -EACCES;
  822. if ((rt->rt_flags & RTCF_BROADCAST) &&
  823. !sock_flag(sk, SOCK_BROADCAST))
  824. goto out;
  825. if (connected)
  826. sk_dst_set(sk, dst_clone(&rt->dst));
  827. }
  828. if (msg->msg_flags&MSG_CONFIRM)
  829. goto do_confirm;
  830. back_from_confirm:
  831. saddr = rt->rt_src;
  832. if (!ipc.addr)
  833. daddr = ipc.addr = rt->rt_dst;
  834. lock_sock(sk);
  835. if (unlikely(up->pending)) {
  836. /* The socket is already corked while preparing it. */
  837. /* ... which is an evident application bug. --ANK */
  838. release_sock(sk);
  839. LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 2\n");
  840. err = -EINVAL;
  841. goto out;
  842. }
  843. /*
  844. * Now cork the socket to pend data.
  845. */
  846. inet->cork.fl.fl4_dst = daddr;
  847. inet->cork.fl.fl_ip_dport = dport;
  848. inet->cork.fl.fl4_src = saddr;
  849. inet->cork.fl.fl_ip_sport = inet->inet_sport;
  850. up->pending = AF_INET;
  851. do_append_data:
  852. up->len += ulen;
  853. getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag;
  854. err = ip_append_data(sk, getfrag, msg->msg_iov, ulen,
  855. sizeof(struct udphdr), &ipc, &rt,
  856. corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags);
  857. if (err)
  858. udp_flush_pending_frames(sk);
  859. else if (!corkreq)
  860. err = udp_push_pending_frames(sk);
  861. else if (unlikely(skb_queue_empty(&sk->sk_write_queue)))
  862. up->pending = 0;
  863. release_sock(sk);
  864. out:
  865. ip_rt_put(rt);
  866. if (free)
  867. kfree(ipc.opt);
  868. if (!err)
  869. return len;
  870. /*
  871. * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
  872. * ENOBUFS might not be good (it's not tunable per se), but otherwise
  873. * we don't have a good statistic (IpOutDiscards but it can be too many
  874. * things). We could add another new stat but at least for now that
  875. * seems like overkill.
  876. */
  877. if (err == -ENOBUFS || test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
  878. UDP_INC_STATS_USER(sock_net(sk),
  879. UDP_MIB_SNDBUFERRORS, is_udplite);
  880. }
  881. return err;
  882. do_confirm:
  883. dst_confirm(&rt->dst);
  884. if (!(msg->msg_flags&MSG_PROBE) || len)
  885. goto back_from_confirm;
  886. err = 0;
  887. goto out;
  888. }
  889. EXPORT_SYMBOL(udp_sendmsg);
  890. int udp_sendpage(struct sock *sk, struct page *page, int offset,
  891. size_t size, int flags)
  892. {
  893. struct udp_sock *up = udp_sk(sk);
  894. int ret;
  895. if (!up->pending) {
  896. struct msghdr msg = { .msg_flags = flags|MSG_MORE };
  897. /* Call udp_sendmsg to specify destination address which
  898. * sendpage interface can't pass.
  899. * This will succeed only when the socket is connected.
  900. */
  901. ret = udp_sendmsg(NULL, sk, &msg, 0);
  902. if (ret < 0)
  903. return ret;
  904. }
  905. lock_sock(sk);
  906. if (unlikely(!up->pending)) {
  907. release_sock(sk);
  908. LIMIT_NETDEBUG(KERN_DEBUG "udp cork app bug 3\n");
  909. return -EINVAL;
  910. }
  911. ret = ip_append_page(sk, page, offset, size, flags);
  912. if (ret == -EOPNOTSUPP) {
  913. release_sock(sk);
  914. return sock_no_sendpage(sk->sk_socket, page, offset,
  915. size, flags);
  916. }
  917. if (ret < 0) {
  918. udp_flush_pending_frames(sk);
  919. goto out;
  920. }
  921. up->len += size;
  922. if (!(up->corkflag || (flags&MSG_MORE)))
  923. ret = udp_push_pending_frames(sk);
  924. if (!ret)
  925. ret = size;
  926. out:
  927. release_sock(sk);
  928. return ret;
  929. }
  930. /**
  931. * first_packet_length - return length of first packet in receive queue
  932. * @sk: socket
  933. *
  934. * Drops all bad checksum frames, until a valid one is found.
  935. * Returns the length of found skb, or 0 if none is found.
  936. */
  937. static unsigned int first_packet_length(struct sock *sk)
  938. {
  939. struct sk_buff_head list_kill, *rcvq = &sk->sk_receive_queue;
  940. struct sk_buff *skb;
  941. unsigned int res;
  942. __skb_queue_head_init(&list_kill);
  943. spin_lock_bh(&rcvq->lock);
  944. while ((skb = skb_peek(rcvq)) != NULL &&
  945. udp_lib_checksum_complete(skb)) {
  946. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS,
  947. IS_UDPLITE(sk));
  948. atomic_inc(&sk->sk_drops);
  949. __skb_unlink(skb, rcvq);
  950. __skb_queue_tail(&list_kill, skb);
  951. }
  952. res = skb ? skb->len : 0;
  953. spin_unlock_bh(&rcvq->lock);
  954. if (!skb_queue_empty(&list_kill)) {
  955. bool slow = lock_sock_fast(sk);
  956. __skb_queue_purge(&list_kill);
  957. sk_mem_reclaim_partial(sk);
  958. unlock_sock_fast(sk, slow);
  959. }
  960. return res;
  961. }
  962. /*
  963. * IOCTL requests applicable to the UDP protocol
  964. */
  965. int udp_ioctl(struct sock *sk, int cmd, unsigned long arg)
  966. {
  967. switch (cmd) {
  968. case SIOCOUTQ:
  969. {
  970. int amount = sk_wmem_alloc_get(sk);
  971. return put_user(amount, (int __user *)arg);
  972. }
  973. case SIOCINQ:
  974. {
  975. unsigned int amount = first_packet_length(sk);
  976. if (amount)
  977. /*
  978. * We will only return the amount
  979. * of this packet since that is all
  980. * that will be read.
  981. */
  982. amount -= sizeof(struct udphdr);
  983. return put_user(amount, (int __user *)arg);
  984. }
  985. default:
  986. return -ENOIOCTLCMD;
  987. }
  988. return 0;
  989. }
  990. EXPORT_SYMBOL(udp_ioctl);
  991. /*
  992. * This should be easy, if there is something there we
  993. * return it, otherwise we block.
  994. */
  995. int udp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
  996. size_t len, int noblock, int flags, int *addr_len)
  997. {
  998. struct inet_sock *inet = inet_sk(sk);
  999. struct sockaddr_in *sin = (struct sockaddr_in *)msg->msg_name;
  1000. struct sk_buff *skb;
  1001. unsigned int ulen;
  1002. int peeked;
  1003. int err;
  1004. int is_udplite = IS_UDPLITE(sk);
  1005. bool slow;
  1006. /*
  1007. * Check any passed addresses
  1008. */
  1009. if (addr_len)
  1010. *addr_len = sizeof(*sin);
  1011. if (flags & MSG_ERRQUEUE)
  1012. return ip_recv_error(sk, msg, len);
  1013. try_again:
  1014. skb = __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0),
  1015. &peeked, &err);
  1016. if (!skb)
  1017. goto out;
  1018. ulen = skb->len - sizeof(struct udphdr);
  1019. if (len > ulen)
  1020. len = ulen;
  1021. else if (len < ulen)
  1022. msg->msg_flags |= MSG_TRUNC;
  1023. /*
  1024. * If checksum is needed at all, try to do it while copying the
  1025. * data. If the data is truncated, or if we only want a partial
  1026. * coverage checksum (UDP-Lite), do it before the copy.
  1027. */
  1028. if (len < ulen || UDP_SKB_CB(skb)->partial_cov) {
  1029. if (udp_lib_checksum_complete(skb))
  1030. goto csum_copy_err;
  1031. }
  1032. if (skb_csum_unnecessary(skb))
  1033. err = skb_copy_datagram_iovec(skb, sizeof(struct udphdr),
  1034. msg->msg_iov, len);
  1035. else {
  1036. err = skb_copy_and_csum_datagram_iovec(skb,
  1037. sizeof(struct udphdr),
  1038. msg->msg_iov);
  1039. if (err == -EINVAL)
  1040. goto csum_copy_err;
  1041. }
  1042. if (err)
  1043. goto out_free;
  1044. if (!peeked)
  1045. UDP_INC_STATS_USER(sock_net(sk),
  1046. UDP_MIB_INDATAGRAMS, is_udplite);
  1047. sock_recv_ts_and_drops(msg, sk, skb);
  1048. /* Copy the address. */
  1049. if (sin) {
  1050. sin->sin_family = AF_INET;
  1051. sin->sin_port = udp_hdr(skb)->source;
  1052. sin->sin_addr.s_addr = ip_hdr(skb)->saddr;
  1053. memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
  1054. }
  1055. if (inet->cmsg_flags)
  1056. ip_cmsg_recv(msg, skb);
  1057. err = len;
  1058. if (flags & MSG_TRUNC)
  1059. err = ulen;
  1060. out_free:
  1061. skb_free_datagram_locked(sk, skb);
  1062. out:
  1063. return err;
  1064. csum_copy_err:
  1065. slow = lock_sock_fast(sk);
  1066. if (!skb_kill_datagram(sk, skb, flags))
  1067. UDP_INC_STATS_USER(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
  1068. unlock_sock_fast(sk, slow);
  1069. if (noblock)
  1070. return -EAGAIN;
  1071. goto try_again;
  1072. }
  1073. int udp_disconnect(struct sock *sk, int flags)
  1074. {
  1075. struct inet_sock *inet = inet_sk(sk);
  1076. /*
  1077. * 1003.1g - break association.
  1078. */
  1079. sk->sk_state = TCP_CLOSE;
  1080. inet->inet_daddr = 0;
  1081. inet->inet_dport = 0;
  1082. sock_rps_save_rxhash(sk, 0);
  1083. sk->sk_bound_dev_if = 0;
  1084. if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
  1085. inet_reset_saddr(sk);
  1086. if (!(sk->sk_userlocks & SOCK_BINDPORT_LOCK)) {
  1087. sk->sk_prot->unhash(sk);
  1088. inet->inet_sport = 0;
  1089. }
  1090. sk_dst_reset(sk);
  1091. return 0;
  1092. }
  1093. EXPORT_SYMBOL(udp_disconnect);
  1094. void udp_lib_unhash(struct sock *sk)
  1095. {
  1096. if (sk_hashed(sk)) {
  1097. struct udp_table *udptable = sk->sk_prot->h.udp_table;
  1098. struct udp_hslot *hslot, *hslot2;
  1099. hslot = udp_hashslot(udptable, sock_net(sk),
  1100. udp_sk(sk)->udp_port_hash);
  1101. hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
  1102. spin_lock_bh(&hslot->lock);
  1103. if (sk_nulls_del_node_init_rcu(sk)) {
  1104. hslot->count--;
  1105. inet_sk(sk)->inet_num = 0;
  1106. sock_prot_inuse_add(sock_net(sk), sk->sk_prot, -1);
  1107. spin_lock(&hslot2->lock);
  1108. hlist_nulls_del_init_rcu(&udp_sk(sk)->udp_portaddr_node);
  1109. hslot2->count--;
  1110. spin_unlock(&hslot2->lock);
  1111. }
  1112. spin_unlock_bh(&hslot->lock);
  1113. }
  1114. }
  1115. EXPORT_SYMBOL(udp_lib_unhash);
  1116. /*
  1117. * inet_rcv_saddr was changed, we must rehash secondary hash
  1118. */
  1119. void udp_lib_rehash(struct sock *sk, u16 newhash)
  1120. {
  1121. if (sk_hashed(sk)) {
  1122. struct udp_table *udptable = sk->sk_prot->h.udp_table;
  1123. struct udp_hslot *hslot, *hslot2, *nhslot2;
  1124. hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
  1125. nhslot2 = udp_hashslot2(udptable, newhash);
  1126. udp_sk(sk)->udp_portaddr_hash = newhash;
  1127. if (hslot2 != nhslot2) {
  1128. hslot = udp_hashslot(udptable, sock_net(sk),
  1129. udp_sk(sk)->udp_port_hash);
  1130. /* we must lock primary chain too */
  1131. spin_lock_bh(&hslot->lock);
  1132. spin_lock(&hslot2->lock);
  1133. hlist_nulls_del_init_rcu(&udp_sk(sk)->udp_portaddr_node);
  1134. hslot2->count--;
  1135. spin_unlock(&hslot2->lock);
  1136. spin_lock(&nhslot2->lock);
  1137. hlist_nulls_add_head_rcu(&udp_sk(sk)->udp_portaddr_node,
  1138. &nhslot2->head);
  1139. nhslot2->count++;
  1140. spin_unlock(&nhslot2->lock);
  1141. spin_unlock_bh(&hslot->lock);
  1142. }
  1143. }
  1144. }
  1145. EXPORT_SYMBOL(udp_lib_rehash);
  1146. static void udp_v4_rehash(struct sock *sk)
  1147. {
  1148. u16 new_hash = udp4_portaddr_hash(sock_net(sk),
  1149. inet_sk(sk)->inet_rcv_saddr,
  1150. inet_sk(sk)->inet_num);
  1151. udp_lib_rehash(sk, new_hash);
  1152. }
  1153. static int __udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
  1154. {
  1155. int rc;
  1156. if (inet_sk(sk)->inet_daddr)
  1157. sock_rps_save_rxhash(sk, skb->rxhash);
  1158. rc = ip_queue_rcv_skb(sk, skb);
  1159. if (rc < 0) {
  1160. int is_udplite = IS_UDPLITE(sk);
  1161. /* Note that an ENOMEM error is charged twice */
  1162. if (rc == -ENOMEM)
  1163. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
  1164. is_udplite);
  1165. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
  1166. kfree_skb(skb);
  1167. return -1;
  1168. }
  1169. return 0;
  1170. }
  1171. /* returns:
  1172. * -1: error
  1173. * 0: success
  1174. * >0: "udp encap" protocol resubmission
  1175. *
  1176. * Note that in the success and error cases, the skb is assumed to
  1177. * have either been requeued or freed.
  1178. */
  1179. int udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
  1180. {
  1181. struct udp_sock *up = udp_sk(sk);
  1182. int rc;
  1183. int is_udplite = IS_UDPLITE(sk);
  1184. /*
  1185. * Charge it to the socket, dropping if the queue is full.
  1186. */
  1187. if (!xfrm4_policy_check(sk, XFRM_POLICY_IN, skb))
  1188. goto drop;
  1189. nf_reset(skb);
  1190. if (up->encap_type) {
  1191. /*
  1192. * This is an encapsulation socket so pass the skb to
  1193. * the socket's udp_encap_rcv() hook. Otherwise, just
  1194. * fall through and pass this up the UDP socket.
  1195. * up->encap_rcv() returns the following value:
  1196. * =0 if skb was successfully passed to the encap
  1197. * handler or was discarded by it.
  1198. * >0 if skb should be passed on to UDP.
  1199. * <0 if skb should be resubmitted as proto -N
  1200. */
  1201. /* if we're overly short, let UDP handle it */
  1202. if (skb->len > sizeof(struct udphdr) &&
  1203. up->encap_rcv != NULL) {
  1204. int ret;
  1205. ret = (*up->encap_rcv)(sk, skb);
  1206. if (ret <= 0) {
  1207. UDP_INC_STATS_BH(sock_net(sk),
  1208. UDP_MIB_INDATAGRAMS,
  1209. is_udplite);
  1210. return -ret;
  1211. }
  1212. }
  1213. /* FALLTHROUGH -- it's a UDP Packet */
  1214. }
  1215. /*
  1216. * UDP-Lite specific tests, ignored on UDP sockets
  1217. */
  1218. if ((is_udplite & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) {
  1219. /*
  1220. * MIB statistics other than incrementing the error count are
  1221. * disabled for the following two types of errors: these depend
  1222. * on the application settings, not on the functioning of the
  1223. * protocol stack as such.
  1224. *
  1225. * RFC 3828 here recommends (sec 3.3): "There should also be a
  1226. * way ... to ... at least let the receiving application block
  1227. * delivery of packets with coverage values less than a value
  1228. * provided by the application."
  1229. */
  1230. if (up->pcrlen == 0) { /* full coverage was set */
  1231. LIMIT_NETDEBUG(KERN_WARNING "UDPLITE: partial coverage "
  1232. "%d while full coverage %d requested\n",
  1233. UDP_SKB_CB(skb)->cscov, skb->len);
  1234. goto drop;
  1235. }
  1236. /* The next case involves violating the min. coverage requested
  1237. * by the receiver. This is subtle: if receiver wants x and x is
  1238. * greater than the buffersize/MTU then receiver will complain
  1239. * that it wants x while sender emits packets of smaller size y.
  1240. * Therefore the above ...()->partial_cov statement is essential.
  1241. */
  1242. if (UDP_SKB_CB(skb)->cscov < up->pcrlen) {
  1243. LIMIT_NETDEBUG(KERN_WARNING
  1244. "UDPLITE: coverage %d too small, need min %d\n",
  1245. UDP_SKB_CB(skb)->cscov, up->pcrlen);
  1246. goto drop;
  1247. }
  1248. }
  1249. if (rcu_dereference_raw(sk->sk_filter)) {
  1250. if (udp_lib_checksum_complete(skb))
  1251. goto drop;
  1252. }
  1253. if (sk_rcvqueues_full(sk, skb))
  1254. goto drop;
  1255. rc = 0;
  1256. bh_lock_sock(sk);
  1257. if (!sock_owned_by_user(sk))
  1258. rc = __udp_queue_rcv_skb(sk, skb);
  1259. else if (sk_add_backlog(sk, skb)) {
  1260. bh_unlock_sock(sk);
  1261. goto drop;
  1262. }
  1263. bh_unlock_sock(sk);
  1264. return rc;
  1265. drop:
  1266. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
  1267. atomic_inc(&sk->sk_drops);
  1268. kfree_skb(skb);
  1269. return -1;
  1270. }
  1271. static void flush_stack(struct sock **stack, unsigned int count,
  1272. struct sk_buff *skb, unsigned int final)
  1273. {
  1274. unsigned int i;
  1275. struct sk_buff *skb1 = NULL;
  1276. struct sock *sk;
  1277. for (i = 0; i < count; i++) {
  1278. sk = stack[i];
  1279. if (likely(skb1 == NULL))
  1280. skb1 = (i == final) ? skb : skb_clone(skb, GFP_ATOMIC);
  1281. if (!skb1) {
  1282. atomic_inc(&sk->sk_drops);
  1283. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
  1284. IS_UDPLITE(sk));
  1285. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS,
  1286. IS_UDPLITE(sk));
  1287. }
  1288. if (skb1 && udp_queue_rcv_skb(sk, skb1) <= 0)
  1289. skb1 = NULL;
  1290. }
  1291. if (unlikely(skb1))
  1292. kfree_skb(skb1);
  1293. }
  1294. /*
  1295. * Multicasts and broadcasts go to each listener.
  1296. *
  1297. * Note: called only from the BH handler context.
  1298. */
  1299. static int __udp4_lib_mcast_deliver(struct net *net, struct sk_buff *skb,
  1300. struct udphdr *uh,
  1301. __be32 saddr, __be32 daddr,
  1302. struct udp_table *udptable)
  1303. {
  1304. struct sock *sk, *stack[256 / sizeof(struct sock *)];
  1305. struct udp_hslot *hslot = udp_hashslot(udptable, net, ntohs(uh->dest));
  1306. int dif;
  1307. unsigned int i, count = 0;
  1308. spin_lock(&hslot->lock);
  1309. sk = sk_nulls_head(&hslot->head);
  1310. dif = skb->dev->ifindex;
  1311. sk = udp_v4_mcast_next(net, sk, uh->dest, daddr, uh->source, saddr, dif);
  1312. while (sk) {
  1313. stack[count++] = sk;
  1314. sk = udp_v4_mcast_next(net, sk_nulls_next(sk), uh->dest,
  1315. daddr, uh->source, saddr, dif);
  1316. if (unlikely(count == ARRAY_SIZE(stack))) {
  1317. if (!sk)
  1318. break;
  1319. flush_stack(stack, count, skb, ~0);
  1320. count = 0;
  1321. }
  1322. }
  1323. /*
  1324. * before releasing chain lock, we must take a reference on sockets
  1325. */
  1326. for (i = 0; i < count; i++)
  1327. sock_hold(stack[i]);
  1328. spin_unlock(&hslot->lock);
  1329. /*
  1330. * do the slow work with no lock held
  1331. */
  1332. if (count) {
  1333. flush_stack(stack, count, skb, count - 1);
  1334. for (i = 0; i < count; i++)
  1335. sock_put(stack[i]);
  1336. } else {
  1337. kfree_skb(skb);
  1338. }
  1339. return 0;
  1340. }
  1341. /* Initialize UDP checksum. If exited with zero value (success),
  1342. * CHECKSUM_UNNECESSARY means, that no more checks are required.
  1343. * Otherwise, csum completion requires chacksumming packet body,
  1344. * including udp header and folding it to skb->csum.
  1345. */
  1346. static inline int udp4_csum_init(struct sk_buff *skb, struct udphdr *uh,
  1347. int proto)
  1348. {
  1349. const struct iphdr *iph;
  1350. int err;
  1351. UDP_SKB_CB(skb)->partial_cov = 0;
  1352. UDP_SKB_CB(skb)->cscov = skb->len;
  1353. if (proto == IPPROTO_UDPLITE) {
  1354. err = udplite_checksum_init(skb, uh);
  1355. if (err)
  1356. return err;
  1357. }
  1358. iph = ip_hdr(skb);
  1359. if (uh->check == 0) {
  1360. skb->ip_summed = CHECKSUM_UNNECESSARY;
  1361. } else if (skb->ip_summed == CHECKSUM_COMPLETE) {
  1362. if (!csum_tcpudp_magic(iph->saddr, iph->daddr, skb->len,
  1363. proto, skb->csum))
  1364. skb->ip_summed = CHECKSUM_UNNECESSARY;
  1365. }
  1366. if (!skb_csum_unnecessary(skb))
  1367. skb->csum = csum_tcpudp_nofold(iph->saddr, iph->daddr,
  1368. skb->len, proto, 0);
  1369. /* Probably, we should checksum udp header (it should be in cache
  1370. * in any case) and data in tiny packets (< rx copybreak).
  1371. */
  1372. return 0;
  1373. }
  1374. /*
  1375. * All we need to do is get the socket, and then do a checksum.
  1376. */
  1377. int __udp4_lib_rcv(struct sk_buff *skb, struct udp_table *udptable,
  1378. int proto)
  1379. {
  1380. struct sock *sk;
  1381. struct udphdr *uh;
  1382. unsigned short ulen;
  1383. struct rtable *rt = skb_rtable(skb);
  1384. __be32 saddr, daddr;
  1385. struct net *net = dev_net(skb->dev);
  1386. /*
  1387. * Validate the packet.
  1388. */
  1389. if (!pskb_may_pull(skb, sizeof(struct udphdr)))
  1390. goto drop; /* No space for header. */
  1391. uh = udp_hdr(skb);
  1392. ulen = ntohs(uh->len);
  1393. saddr = ip_hdr(skb)->saddr;
  1394. daddr = ip_hdr(skb)->daddr;
  1395. if (ulen > skb->len)
  1396. goto short_packet;
  1397. if (proto == IPPROTO_UDP) {
  1398. /* UDP validates ulen. */
  1399. if (ulen < sizeof(*uh) || pskb_trim_rcsum(skb, ulen))
  1400. goto short_packet;
  1401. uh = udp_hdr(skb);
  1402. }
  1403. if (udp4_csum_init(skb, uh, proto))
  1404. goto csum_error;
  1405. if (rt->rt_flags & (RTCF_BROADCAST|RTCF_MULTICAST))
  1406. return __udp4_lib_mcast_deliver(net, skb, uh,
  1407. saddr, daddr, udptable);
  1408. sk = __udp4_lib_lookup_skb(skb, uh->source, uh->dest, udptable);
  1409. if (sk != NULL) {
  1410. int ret = udp_queue_rcv_skb(sk, skb);
  1411. sock_put(sk);
  1412. /* a return value > 0 means to resubmit the input, but
  1413. * it wants the return to be -protocol, or 0
  1414. */
  1415. if (ret > 0)
  1416. return -ret;
  1417. return 0;
  1418. }
  1419. if (!xfrm4_policy_check(NULL, XFRM_POLICY_IN, skb))
  1420. goto drop;
  1421. nf_reset(skb);
  1422. /* No socket. Drop packet silently, if checksum is wrong */
  1423. if (udp_lib_checksum_complete(skb))
  1424. goto csum_error;
  1425. UDP_INC_STATS_BH(net, UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE);
  1426. icmp_send(skb, ICMP_DEST_UNREACH, ICMP_PORT_UNREACH, 0);
  1427. /*
  1428. * Hmm. We got an UDP packet to a port to which we
  1429. * don't wanna listen. Ignore it.
  1430. */
  1431. kfree_skb(skb);
  1432. return 0;
  1433. short_packet:
  1434. LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: short packet: From %pI4:%u %d/%d to %pI4:%u\n",
  1435. proto == IPPROTO_UDPLITE ? "-Lite" : "",
  1436. &saddr,
  1437. ntohs(uh->source),
  1438. ulen,
  1439. skb->len,
  1440. &daddr,
  1441. ntohs(uh->dest));
  1442. goto drop;
  1443. csum_error:
  1444. /*
  1445. * RFC1122: OK. Discards the bad packet silently (as far as
  1446. * the network is concerned, anyway) as per 4.1.3.4 (MUST).
  1447. */
  1448. LIMIT_NETDEBUG(KERN_DEBUG "UDP%s: bad checksum. From %pI4:%u to %pI4:%u ulen %d\n",
  1449. proto == IPPROTO_UDPLITE ? "-Lite" : "",
  1450. &saddr,
  1451. ntohs(uh->source),
  1452. &daddr,
  1453. ntohs(uh->dest),
  1454. ulen);
  1455. drop:
  1456. UDP_INC_STATS_BH(net, UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE);
  1457. kfree_skb(skb);
  1458. return 0;
  1459. }
  1460. int udp_rcv(struct sk_buff *skb)
  1461. {
  1462. return __udp4_lib_rcv(skb, &udp_table, IPPROTO_UDP);
  1463. }
  1464. void udp_destroy_sock(struct sock *sk)
  1465. {
  1466. bool slow = lock_sock_fast(sk);
  1467. udp_flush_pending_frames(sk);
  1468. unlock_sock_fast(sk, slow);
  1469. }
  1470. /*
  1471. * Socket option code for UDP
  1472. */
  1473. int udp_lib_setsockopt(struct sock *sk, int level, int optname,
  1474. char __user *optval, unsigned int optlen,
  1475. int (*push_pending_frames)(struct sock *))
  1476. {
  1477. struct udp_sock *up = udp_sk(sk);
  1478. int val;
  1479. int err = 0;
  1480. int is_udplite = IS_UDPLITE(sk);
  1481. if (optlen < sizeof(int))
  1482. return -EINVAL;
  1483. if (get_user(val, (int __user *)optval))
  1484. return -EFAULT;
  1485. switch (optname) {
  1486. case UDP_CORK:
  1487. if (val != 0) {
  1488. up->corkflag = 1;
  1489. } else {
  1490. up->corkflag = 0;
  1491. lock_sock(sk);
  1492. (*push_pending_frames)(sk);
  1493. release_sock(sk);
  1494. }
  1495. break;
  1496. case UDP_ENCAP:
  1497. switch (val) {
  1498. case 0:
  1499. case UDP_ENCAP_ESPINUDP:
  1500. case UDP_ENCAP_ESPINUDP_NON_IKE:
  1501. up->encap_rcv = xfrm4_udp_encap_rcv;
  1502. /* FALLTHROUGH */
  1503. case UDP_ENCAP_L2TPINUDP:
  1504. up->encap_type = val;
  1505. break;
  1506. default:
  1507. err = -ENOPROTOOPT;
  1508. break;
  1509. }
  1510. break;
  1511. /*
  1512. * UDP-Lite's partial checksum coverage (RFC 3828).
  1513. */
  1514. /* The sender sets actual checksum coverage length via this option.
  1515. * The case coverage > packet length is handled by send module. */
  1516. case UDPLITE_SEND_CSCOV:
  1517. if (!is_udplite) /* Disable the option on UDP sockets */
  1518. return -ENOPROTOOPT;
  1519. if (val != 0 && val < 8) /* Illegal coverage: use default (8) */
  1520. val = 8;
  1521. else if (val > USHRT_MAX)
  1522. val = USHRT_MAX;
  1523. up->pcslen = val;
  1524. up->pcflag |= UDPLITE_SEND_CC;
  1525. break;
  1526. /* The receiver specifies a minimum checksum coverage value. To make
  1527. * sense, this should be set to at least 8 (as done below). If zero is
  1528. * used, this again means full checksum coverage. */
  1529. case UDPLITE_RECV_CSCOV:
  1530. if (!is_udplite) /* Disable the option on UDP sockets */
  1531. return -ENOPROTOOPT;
  1532. if (val != 0 && val < 8) /* Avoid silly minimal values. */
  1533. val = 8;
  1534. else if (val > USHRT_MAX)
  1535. val = USHRT_MAX;
  1536. up->pcrlen = val;
  1537. up->pcflag |= UDPLITE_RECV_CC;
  1538. break;
  1539. default:
  1540. err = -ENOPROTOOPT;
  1541. break;
  1542. }
  1543. return err;
  1544. }
  1545. EXPORT_SYMBOL(udp_lib_setsockopt);
  1546. int udp_setsockopt(struct sock *sk, int level, int optname,
  1547. char __user *optval, unsigned int optlen)
  1548. {
  1549. if (level == SOL_UDP || level == SOL_UDPLITE)
  1550. return udp_lib_setsockopt(sk, level, optname, optval, optlen,
  1551. udp_push_pending_frames);
  1552. return ip_setsockopt(sk, level, optname, optval, optlen);
  1553. }
  1554. #ifdef CONFIG_COMPAT
  1555. int compat_udp_setsockopt(struct sock *sk, int level, int optname,
  1556. char __user *optval, unsigned int optlen)
  1557. {
  1558. if (level == SOL_UDP || level == SOL_UDPLITE)
  1559. return udp_lib_setsockopt(sk, level, optname, optval, optlen,
  1560. udp_push_pending_frames);
  1561. return compat_ip_setsockopt(sk, level, optname, optval, optlen);
  1562. }
  1563. #endif
  1564. int udp_lib_getsockopt(struct sock *sk, int level, int optname,
  1565. char __user *optval, int __user *optlen)
  1566. {
  1567. struct udp_sock *up = udp_sk(sk);
  1568. int val, len;
  1569. if (get_user(len, optlen))
  1570. return -EFAULT;
  1571. len = min_t(unsigned int, len, sizeof(int));
  1572. if (len < 0)
  1573. return -EINVAL;
  1574. switch (optname) {
  1575. case UDP_CORK:
  1576. val = up->corkflag;
  1577. break;
  1578. case UDP_ENCAP:
  1579. val = up->encap_type;
  1580. break;
  1581. /* The following two cannot be changed on UDP sockets, the return is
  1582. * always 0 (which corresponds to the full checksum coverage of UDP). */
  1583. case UDPLITE_SEND_CSCOV:
  1584. val = up->pcslen;
  1585. break;
  1586. case UDPLITE_RECV_CSCOV:
  1587. val = up->pcrlen;
  1588. break;
  1589. default:
  1590. return -ENOPROTOOPT;
  1591. }
  1592. if (put_user(len, optlen))
  1593. return -EFAULT;
  1594. if (copy_to_user(optval, &val, len))
  1595. return -EFAULT;
  1596. return 0;
  1597. }
  1598. EXPORT_SYMBOL(udp_lib_getsockopt);
  1599. int udp_getsockopt(struct sock *sk, int level, int optname,
  1600. char __user *optval, int __user *optlen)
  1601. {
  1602. if (level == SOL_UDP || level == SOL_UDPLITE)
  1603. return udp_lib_getsockopt(sk, level, optname, optval, optlen);
  1604. return ip_getsockopt(sk, level, optname, optval, optlen);
  1605. }
  1606. #ifdef CONFIG_COMPAT
  1607. int compat_udp_getsockopt(struct sock *sk, int level, int optname,
  1608. char __user *optval, int __user *optlen)
  1609. {
  1610. if (level == SOL_UDP || level == SOL_UDPLITE)
  1611. return udp_lib_getsockopt(sk, level, optname, optval, optlen);
  1612. return compat_ip_getsockopt(sk, level, optname, optval, optlen);
  1613. }
  1614. #endif
  1615. /**
  1616. * udp_poll - wait for a UDP event.
  1617. * @file - file struct
  1618. * @sock - socket
  1619. * @wait - poll table
  1620. *
  1621. * This is same as datagram poll, except for the special case of
  1622. * blocking sockets. If application is using a blocking fd
  1623. * and a packet with checksum error is in the queue;
  1624. * then it could get return from select indicating data available
  1625. * but then block when reading it. Add special case code
  1626. * to work around these arguably broken applications.
  1627. */
  1628. unsigned int udp_poll(struct file *file, struct socket *sock, poll_table *wait)
  1629. {
  1630. unsigned int mask = datagram_poll(file, sock, wait);
  1631. struct sock *sk = sock->sk;
  1632. /* Check for false positives due to checksum errors */
  1633. if ((mask & POLLRDNORM) && !(file->f_flags & O_NONBLOCK) &&
  1634. !(sk->sk_shutdown & RCV_SHUTDOWN) && !first_packet_length(sk))
  1635. mask &= ~(POLLIN | POLLRDNORM);
  1636. return mask;
  1637. }
  1638. EXPORT_SYMBOL(udp_poll);
  1639. struct proto udp_prot = {
  1640. .name = "UDP",
  1641. .owner = THIS_MODULE,
  1642. .close = udp_lib_close,
  1643. .connect = ip4_datagram_connect,
  1644. .disconnect = udp_disconnect,
  1645. .ioctl = udp_ioctl,
  1646. .destroy = udp_destroy_sock,
  1647. .setsockopt = udp_setsockopt,
  1648. .getsockopt = udp_getsockopt,
  1649. .sendmsg = udp_sendmsg,
  1650. .recvmsg = udp_recvmsg,
  1651. .sendpage = udp_sendpage,
  1652. .backlog_rcv = __udp_queue_rcv_skb,
  1653. .hash = udp_lib_hash,
  1654. .unhash = udp_lib_unhash,
  1655. .rehash = udp_v4_rehash,
  1656. .get_port = udp_v4_get_port,
  1657. .memory_allocated = &udp_memory_allocated,
  1658. .sysctl_mem = sysctl_udp_mem,
  1659. .sysctl_wmem = &sysctl_udp_wmem_min,
  1660. .sysctl_rmem = &sysctl_udp_rmem_min,
  1661. .obj_size = sizeof(struct udp_sock),
  1662. .slab_flags = SLAB_DESTROY_BY_RCU,
  1663. .h.udp_table = &udp_table,
  1664. #ifdef CONFIG_COMPAT
  1665. .compat_setsockopt = compat_udp_setsockopt,
  1666. .compat_getsockopt = compat_udp_getsockopt,
  1667. #endif
  1668. .clear_sk = sk_prot_clear_portaddr_nulls,
  1669. };
  1670. EXPORT_SYMBOL(udp_prot);
  1671. /* ------------------------------------------------------------------------ */
  1672. #ifdef CONFIG_PROC_FS
  1673. static struct sock *udp_get_first(struct seq_file *seq, int start)
  1674. {
  1675. struct sock *sk;
  1676. struct udp_iter_state *state = seq->private;
  1677. struct net *net = seq_file_net(seq);
  1678. for (state->bucket = start; state->bucket <= state->udp_table->mask;
  1679. ++state->bucket) {
  1680. struct hlist_nulls_node *node;
  1681. struct udp_hslot *hslot = &state->udp_table->hash[state->bucket];
  1682. if (hlist_nulls_empty(&hslot->head))
  1683. continue;
  1684. spin_lock_bh(&hslot->lock);
  1685. sk_nulls_for_each(sk, node, &hslot->head) {
  1686. if (!net_eq(sock_net(sk), net))
  1687. continue;
  1688. if (sk->sk_family == state->family)
  1689. goto found;
  1690. }
  1691. spin_unlock_bh(&hslot->lock);
  1692. }
  1693. sk = NULL;
  1694. found:
  1695. return sk;
  1696. }
  1697. static struct sock *udp_get_next(struct seq_file *seq, struct sock *sk)
  1698. {
  1699. struct udp_iter_state *state = seq->private;
  1700. struct net *net = seq_file_net(seq);
  1701. do {
  1702. sk = sk_nulls_next(sk);
  1703. } while (sk && (!net_eq(sock_net(sk), net) || sk->sk_family != state->family));
  1704. if (!sk) {
  1705. if (state->bucket <= state->udp_table->mask)
  1706. spin_unlock_bh(&state->udp_table->hash[state->bucket].lock);
  1707. return udp_get_first(seq, state->bucket + 1);
  1708. }
  1709. return sk;
  1710. }
  1711. static struct sock *udp_get_idx(struct seq_file *seq, loff_t pos)
  1712. {
  1713. struct sock *sk = udp_get_first(seq, 0);
  1714. if (sk)
  1715. while (pos && (sk = udp_get_next(seq, sk)) != NULL)
  1716. --pos;
  1717. return pos ? NULL : sk;
  1718. }
  1719. static void *udp_seq_start(struct seq_file *seq, loff_t *pos)
  1720. {
  1721. struct udp_iter_state *state = seq->private;
  1722. state->bucket = MAX_UDP_PORTS;
  1723. return *pos ? udp_get_idx(seq, *pos-1) : SEQ_START_TOKEN;
  1724. }
  1725. static void *udp_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  1726. {
  1727. struct sock *sk;
  1728. if (v == SEQ_START_TOKEN)
  1729. sk = udp_get_idx(seq, 0);
  1730. else
  1731. sk = udp_get_next(seq, v);
  1732. ++*pos;
  1733. return sk;
  1734. }
  1735. static void udp_seq_stop(struct seq_file *seq, void *v)
  1736. {
  1737. struct udp_iter_state *state = seq->private;
  1738. if (state->bucket <= state->udp_table->mask)
  1739. spin_unlock_bh(&state->udp_table->hash[state->bucket].lock);
  1740. }
  1741. static int udp_seq_open(struct inode *inode, struct file *file)
  1742. {
  1743. struct udp_seq_afinfo *afinfo = PDE(inode)->data;
  1744. struct udp_iter_state *s;
  1745. int err;
  1746. err = seq_open_net(inode, file, &afinfo->seq_ops,
  1747. sizeof(struct udp_iter_state));
  1748. if (err < 0)
  1749. return err;
  1750. s = ((struct seq_file *)file->private_data)->private;
  1751. s->family = afinfo->family;
  1752. s->udp_table = afinfo->udp_table;
  1753. return err;
  1754. }
  1755. /* ------------------------------------------------------------------------ */
  1756. int udp_proc_register(struct net *net, struct udp_seq_afinfo *afinfo)
  1757. {
  1758. struct proc_dir_entry *p;
  1759. int rc = 0;
  1760. afinfo->seq_fops.open = udp_seq_open;
  1761. afinfo->seq_fops.read = seq_read;
  1762. afinfo->seq_fops.llseek = seq_lseek;
  1763. afinfo->seq_fops.release = seq_release_net;
  1764. afinfo->seq_ops.start = udp_seq_start;
  1765. afinfo->seq_ops.next = udp_seq_next;
  1766. afinfo->seq_ops.stop = udp_seq_stop;
  1767. p = proc_create_data(afinfo->name, S_IRUGO, net->proc_net,
  1768. &afinfo->seq_fops, afinfo);
  1769. if (!p)
  1770. rc = -ENOMEM;
  1771. return rc;
  1772. }
  1773. EXPORT_SYMBOL(udp_proc_register);
  1774. void udp_proc_unregister(struct net *net, struct udp_seq_afinfo *afinfo)
  1775. {
  1776. proc_net_remove(net, afinfo->name);
  1777. }
  1778. EXPORT_SYMBOL(udp_proc_unregister);
  1779. /* ------------------------------------------------------------------------ */
  1780. static void udp4_format_sock(struct sock *sp, struct seq_file *f,
  1781. int bucket, int *len)
  1782. {
  1783. struct inet_sock *inet = inet_sk(sp);
  1784. __be32 dest = inet->inet_daddr;
  1785. __be32 src = inet->inet_rcv_saddr;
  1786. __u16 destp = ntohs(inet->inet_dport);
  1787. __u16 srcp = ntohs(inet->inet_sport);
  1788. seq_printf(f, "%5d: %08X:%04X %08X:%04X"
  1789. " %02X %08X:%08X %02X:%08lX %08X %5d %8d %lu %d %p %d%n",
  1790. bucket, src, srcp, dest, destp, sp->sk_state,
  1791. sk_wmem_alloc_get(sp),
  1792. sk_rmem_alloc_get(sp),
  1793. 0, 0L, 0, sock_i_uid(sp), 0, sock_i_ino(sp),
  1794. atomic_read(&sp->sk_refcnt), sp,
  1795. atomic_read(&sp->sk_drops), len);
  1796. }
  1797. int udp4_seq_show(struct seq_file *seq, void *v)
  1798. {
  1799. if (v == SEQ_START_TOKEN)
  1800. seq_printf(seq, "%-127s\n",
  1801. " sl local_address rem_address st tx_queue "
  1802. "rx_queue tr tm->when retrnsmt uid timeout "
  1803. "inode ref pointer drops");
  1804. else {
  1805. struct udp_iter_state *state = seq->private;
  1806. int len;
  1807. udp4_format_sock(v, seq, state->bucket, &len);
  1808. seq_printf(seq, "%*s\n", 127 - len, "");
  1809. }
  1810. return 0;
  1811. }
  1812. /* ------------------------------------------------------------------------ */
  1813. static struct udp_seq_afinfo udp4_seq_afinfo = {
  1814. .name = "udp",
  1815. .family = AF_INET,
  1816. .udp_table = &udp_table,
  1817. .seq_fops = {
  1818. .owner = THIS_MODULE,
  1819. },
  1820. .seq_ops = {
  1821. .show = udp4_seq_show,
  1822. },
  1823. };
  1824. static int __net_init udp4_proc_init_net(struct net *net)
  1825. {
  1826. return udp_proc_register(net, &udp4_seq_afinfo);
  1827. }
  1828. static void __net_exit udp4_proc_exit_net(struct net *net)
  1829. {
  1830. udp_proc_unregister(net, &udp4_seq_afinfo);
  1831. }
  1832. static struct pernet_operations udp4_net_ops = {
  1833. .init = udp4_proc_init_net,
  1834. .exit = udp4_proc_exit_net,
  1835. };
  1836. int __init udp4_proc_init(void)
  1837. {
  1838. return register_pernet_subsys(&udp4_net_ops);
  1839. }
  1840. void udp4_proc_exit(void)
  1841. {
  1842. unregister_pernet_subsys(&udp4_net_ops);
  1843. }
  1844. #endif /* CONFIG_PROC_FS */
  1845. static __initdata unsigned long uhash_entries;
  1846. static int __init set_uhash_entries(char *str)
  1847. {
  1848. if (!str)
  1849. return 0;
  1850. uhash_entries = simple_strtoul(str, &str, 0);
  1851. if (uhash_entries && uhash_entries < UDP_HTABLE_SIZE_MIN)
  1852. uhash_entries = UDP_HTABLE_SIZE_MIN;
  1853. return 1;
  1854. }
  1855. __setup("uhash_entries=", set_uhash_entries);
  1856. void __init udp_table_init(struct udp_table *table, const char *name)
  1857. {
  1858. unsigned int i;
  1859. if (!CONFIG_BASE_SMALL)
  1860. table->hash = alloc_large_system_hash(name,
  1861. 2 * sizeof(struct udp_hslot),
  1862. uhash_entries,
  1863. 21, /* one slot per 2 MB */
  1864. 0,
  1865. &table->log,
  1866. &table->mask,
  1867. 64 * 1024);
  1868. /*
  1869. * Make sure hash table has the minimum size
  1870. */
  1871. if (CONFIG_BASE_SMALL || table->mask < UDP_HTABLE_SIZE_MIN - 1) {
  1872. table->hash = kmalloc(UDP_HTABLE_SIZE_MIN *
  1873. 2 * sizeof(struct udp_hslot), GFP_KERNEL);
  1874. if (!table->hash)
  1875. panic(name);
  1876. table->log = ilog2(UDP_HTABLE_SIZE_MIN);
  1877. table->mask = UDP_HTABLE_SIZE_MIN - 1;
  1878. }
  1879. table->hash2 = table->hash + (table->mask + 1);
  1880. for (i = 0; i <= table->mask; i++) {
  1881. INIT_HLIST_NULLS_HEAD(&table->hash[i].head, i);
  1882. table->hash[i].count = 0;
  1883. spin_lock_init(&table->hash[i].lock);
  1884. }
  1885. for (i = 0; i <= table->mask; i++) {
  1886. INIT_HLIST_NULLS_HEAD(&table->hash2[i].head, i);
  1887. table->hash2[i].count = 0;
  1888. spin_lock_init(&table->hash2[i].lock);
  1889. }
  1890. }
  1891. void __init udp_init(void)
  1892. {
  1893. unsigned long nr_pages, limit;
  1894. udp_table_init(&udp_table, "UDP");
  1895. /* Set the pressure threshold up by the same strategy of TCP. It is a
  1896. * fraction of global memory that is up to 1/2 at 256 MB, decreasing
  1897. * toward zero with the amount of memory, with a floor of 128 pages.
  1898. */
  1899. nr_pages = totalram_pages - totalhigh_pages;
  1900. limit = min(nr_pages, 1UL<<(28-PAGE_SHIFT)) >> (20-PAGE_SHIFT);
  1901. limit = (limit * (nr_pages >> (20-PAGE_SHIFT))) >> (PAGE_SHIFT-11);
  1902. limit = max(limit, 128UL);
  1903. sysctl_udp_mem[0] = limit / 4 * 3;
  1904. sysctl_udp_mem[1] = limit;
  1905. sysctl_udp_mem[2] = sysctl_udp_mem[0] * 2;
  1906. sysctl_udp_rmem_min = SK_MEM_QUANTUM;
  1907. sysctl_udp_wmem_min = SK_MEM_QUANTUM;
  1908. }
  1909. int udp4_ufo_send_check(struct sk_buff *skb)
  1910. {
  1911. const struct iphdr *iph;
  1912. struct udphdr *uh;
  1913. if (!pskb_may_pull(skb, sizeof(*uh)))
  1914. return -EINVAL;
  1915. iph = ip_hdr(skb);
  1916. uh = udp_hdr(skb);
  1917. uh->check = ~csum_tcpudp_magic(iph->saddr, iph->daddr, skb->len,
  1918. IPPROTO_UDP, 0);
  1919. skb->csum_start = skb_transport_header(skb) - skb->head;
  1920. skb->csum_offset = offsetof(struct udphdr, check);
  1921. skb->ip_summed = CHECKSUM_PARTIAL;
  1922. return 0;
  1923. }
  1924. struct sk_buff *udp4_ufo_fragment(struct sk_buff *skb, int features)
  1925. {
  1926. struct sk_buff *segs = ERR_PTR(-EINVAL);
  1927. unsigned int mss;
  1928. int offset;
  1929. __wsum csum;
  1930. mss = skb_shinfo(skb)->gso_size;
  1931. if (unlikely(skb->len <= mss))
  1932. goto out;
  1933. if (skb_gso_ok(skb, features | NETIF_F_GSO_ROBUST)) {
  1934. /* Packet is from an untrusted source, reset gso_segs. */
  1935. int type = skb_shinfo(skb)->gso_type;
  1936. if (unlikely(type & ~(SKB_GSO_UDP | SKB_GSO_DODGY) ||
  1937. !(type & (SKB_GSO_UDP))))
  1938. goto out;
  1939. skb_shinfo(skb)->gso_segs = DIV_ROUND_UP(skb->len, mss);
  1940. segs = NULL;
  1941. goto out;
  1942. }
  1943. /* Do software UFO. Complete and fill in the UDP checksum as HW cannot
  1944. * do checksum of UDP packets sent as multiple IP fragments.
  1945. */
  1946. offset = skb_checksum_start_offset(skb);
  1947. csum = skb_checksum(skb, offset, skb->len - offset, 0);
  1948. offset += skb->csum_offset;
  1949. *(__sum16 *)(skb->data + offset) = csum_fold(csum);
  1950. skb->ip_summed = CHECKSUM_NONE;
  1951. /* Fragment the skb. IP headers of the fragments are updated in
  1952. * inet_gso_segment()
  1953. */
  1954. segs = skb_segment(skb, features);
  1955. out:
  1956. return segs;
  1957. }