udp.c 64 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540
  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. #define pr_fmt(fmt) "UDP: " fmt
  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/inetdevice.h>
  92. #include <linux/in.h>
  93. #include <linux/errno.h>
  94. #include <linux/timer.h>
  95. #include <linux/mm.h>
  96. #include <linux/inet.h>
  97. #include <linux/netdevice.h>
  98. #include <linux/slab.h>
  99. #include <net/tcp_states.h>
  100. #include <linux/skbuff.h>
  101. #include <linux/proc_fs.h>
  102. #include <linux/seq_file.h>
  103. #include <net/net_namespace.h>
  104. #include <net/icmp.h>
  105. #include <net/inet_hashtables.h>
  106. #include <net/route.h>
  107. #include <net/checksum.h>
  108. #include <net/xfrm.h>
  109. #include <trace/events/udp.h>
  110. #include <linux/static_key.h>
  111. #include <trace/events/skb.h>
  112. #include <net/busy_poll.h>
  113. #include "udp_impl.h"
  114. #include <net/sock_reuseport.h>
  115. struct udp_table udp_table __read_mostly;
  116. EXPORT_SYMBOL(udp_table);
  117. long sysctl_udp_mem[3] __read_mostly;
  118. EXPORT_SYMBOL(sysctl_udp_mem);
  119. int sysctl_udp_rmem_min __read_mostly;
  120. EXPORT_SYMBOL(sysctl_udp_rmem_min);
  121. int sysctl_udp_wmem_min __read_mostly;
  122. EXPORT_SYMBOL(sysctl_udp_wmem_min);
  123. atomic_long_t udp_memory_allocated;
  124. EXPORT_SYMBOL(udp_memory_allocated);
  125. #define MAX_UDP_PORTS 65536
  126. #define PORTS_PER_CHAIN (MAX_UDP_PORTS / UDP_HTABLE_SIZE_MIN)
  127. static int udp_lib_lport_inuse(struct net *net, __u16 num,
  128. const struct udp_hslot *hslot,
  129. unsigned long *bitmap,
  130. struct sock *sk,
  131. int (*saddr_comp)(const struct sock *sk1,
  132. const struct sock *sk2,
  133. bool match_wildcard),
  134. unsigned int log)
  135. {
  136. struct sock *sk2;
  137. kuid_t uid = sock_i_uid(sk);
  138. sk_for_each(sk2, &hslot->head) {
  139. if (net_eq(sock_net(sk2), net) &&
  140. sk2 != sk &&
  141. (bitmap || udp_sk(sk2)->udp_port_hash == num) &&
  142. (!sk2->sk_reuse || !sk->sk_reuse) &&
  143. (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if ||
  144. sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
  145. (!sk2->sk_reuseport || !sk->sk_reuseport ||
  146. rcu_access_pointer(sk->sk_reuseport_cb) ||
  147. !uid_eq(uid, sock_i_uid(sk2))) &&
  148. saddr_comp(sk, sk2, true)) {
  149. if (!bitmap)
  150. return 1;
  151. __set_bit(udp_sk(sk2)->udp_port_hash >> log, bitmap);
  152. }
  153. }
  154. return 0;
  155. }
  156. /*
  157. * Note: we still hold spinlock of primary hash chain, so no other writer
  158. * can insert/delete a socket with local_port == num
  159. */
  160. static int udp_lib_lport_inuse2(struct net *net, __u16 num,
  161. struct udp_hslot *hslot2,
  162. struct sock *sk,
  163. int (*saddr_comp)(const struct sock *sk1,
  164. const struct sock *sk2,
  165. bool match_wildcard))
  166. {
  167. struct sock *sk2;
  168. kuid_t uid = sock_i_uid(sk);
  169. int res = 0;
  170. spin_lock(&hslot2->lock);
  171. udp_portaddr_for_each_entry(sk2, &hslot2->head) {
  172. if (net_eq(sock_net(sk2), net) &&
  173. sk2 != sk &&
  174. (udp_sk(sk2)->udp_port_hash == num) &&
  175. (!sk2->sk_reuse || !sk->sk_reuse) &&
  176. (!sk2->sk_bound_dev_if || !sk->sk_bound_dev_if ||
  177. sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
  178. (!sk2->sk_reuseport || !sk->sk_reuseport ||
  179. rcu_access_pointer(sk->sk_reuseport_cb) ||
  180. !uid_eq(uid, sock_i_uid(sk2))) &&
  181. saddr_comp(sk, sk2, true)) {
  182. res = 1;
  183. break;
  184. }
  185. }
  186. spin_unlock(&hslot2->lock);
  187. return res;
  188. }
  189. static int udp_reuseport_add_sock(struct sock *sk, struct udp_hslot *hslot,
  190. int (*saddr_same)(const struct sock *sk1,
  191. const struct sock *sk2,
  192. bool match_wildcard))
  193. {
  194. struct net *net = sock_net(sk);
  195. kuid_t uid = sock_i_uid(sk);
  196. struct sock *sk2;
  197. sk_for_each(sk2, &hslot->head) {
  198. if (net_eq(sock_net(sk2), net) &&
  199. sk2 != sk &&
  200. sk2->sk_family == sk->sk_family &&
  201. ipv6_only_sock(sk2) == ipv6_only_sock(sk) &&
  202. (udp_sk(sk2)->udp_port_hash == udp_sk(sk)->udp_port_hash) &&
  203. (sk2->sk_bound_dev_if == sk->sk_bound_dev_if) &&
  204. sk2->sk_reuseport && uid_eq(uid, sock_i_uid(sk2)) &&
  205. (*saddr_same)(sk, sk2, false)) {
  206. return reuseport_add_sock(sk, sk2);
  207. }
  208. }
  209. /* Initial allocation may have already happened via setsockopt */
  210. if (!rcu_access_pointer(sk->sk_reuseport_cb))
  211. return reuseport_alloc(sk);
  212. return 0;
  213. }
  214. /**
  215. * udp_lib_get_port - UDP/-Lite port lookup for IPv4 and IPv6
  216. *
  217. * @sk: socket struct in question
  218. * @snum: port number to look up
  219. * @saddr_comp: AF-dependent comparison of bound local IP addresses
  220. * @hash2_nulladdr: AF-dependent hash value in secondary hash chains,
  221. * with NULL address
  222. */
  223. int udp_lib_get_port(struct sock *sk, unsigned short snum,
  224. int (*saddr_comp)(const struct sock *sk1,
  225. const struct sock *sk2,
  226. bool match_wildcard),
  227. unsigned int hash2_nulladdr)
  228. {
  229. struct udp_hslot *hslot, *hslot2;
  230. struct udp_table *udptable = sk->sk_prot->h.udp_table;
  231. int error = 1;
  232. struct net *net = sock_net(sk);
  233. if (!snum) {
  234. int low, high, remaining;
  235. unsigned int rand;
  236. unsigned short first, last;
  237. DECLARE_BITMAP(bitmap, PORTS_PER_CHAIN);
  238. inet_get_local_port_range(net, &low, &high);
  239. remaining = (high - low) + 1;
  240. rand = prandom_u32();
  241. first = reciprocal_scale(rand, remaining) + low;
  242. /*
  243. * force rand to be an odd multiple of UDP_HTABLE_SIZE
  244. */
  245. rand = (rand | 1) * (udptable->mask + 1);
  246. last = first + udptable->mask + 1;
  247. do {
  248. hslot = udp_hashslot(udptable, net, first);
  249. bitmap_zero(bitmap, PORTS_PER_CHAIN);
  250. spin_lock_bh(&hslot->lock);
  251. udp_lib_lport_inuse(net, snum, hslot, bitmap, sk,
  252. saddr_comp, udptable->log);
  253. snum = first;
  254. /*
  255. * Iterate on all possible values of snum for this hash.
  256. * Using steps of an odd multiple of UDP_HTABLE_SIZE
  257. * give us randomization and full range coverage.
  258. */
  259. do {
  260. if (low <= snum && snum <= high &&
  261. !test_bit(snum >> udptable->log, bitmap) &&
  262. !inet_is_local_reserved_port(net, snum))
  263. goto found;
  264. snum += rand;
  265. } while (snum != first);
  266. spin_unlock_bh(&hslot->lock);
  267. } while (++first != last);
  268. goto fail;
  269. } else {
  270. hslot = udp_hashslot(udptable, net, snum);
  271. spin_lock_bh(&hslot->lock);
  272. if (hslot->count > 10) {
  273. int exist;
  274. unsigned int slot2 = udp_sk(sk)->udp_portaddr_hash ^ snum;
  275. slot2 &= udptable->mask;
  276. hash2_nulladdr &= udptable->mask;
  277. hslot2 = udp_hashslot2(udptable, slot2);
  278. if (hslot->count < hslot2->count)
  279. goto scan_primary_hash;
  280. exist = udp_lib_lport_inuse2(net, snum, hslot2,
  281. sk, saddr_comp);
  282. if (!exist && (hash2_nulladdr != slot2)) {
  283. hslot2 = udp_hashslot2(udptable, hash2_nulladdr);
  284. exist = udp_lib_lport_inuse2(net, snum, hslot2,
  285. sk, saddr_comp);
  286. }
  287. if (exist)
  288. goto fail_unlock;
  289. else
  290. goto found;
  291. }
  292. scan_primary_hash:
  293. if (udp_lib_lport_inuse(net, snum, hslot, NULL, sk,
  294. saddr_comp, 0))
  295. goto fail_unlock;
  296. }
  297. found:
  298. inet_sk(sk)->inet_num = snum;
  299. udp_sk(sk)->udp_port_hash = snum;
  300. udp_sk(sk)->udp_portaddr_hash ^= snum;
  301. if (sk_unhashed(sk)) {
  302. if (sk->sk_reuseport &&
  303. udp_reuseport_add_sock(sk, hslot, saddr_comp)) {
  304. inet_sk(sk)->inet_num = 0;
  305. udp_sk(sk)->udp_port_hash = 0;
  306. udp_sk(sk)->udp_portaddr_hash ^= snum;
  307. goto fail_unlock;
  308. }
  309. sk_add_node_rcu(sk, &hslot->head);
  310. hslot->count++;
  311. sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1);
  312. hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
  313. spin_lock(&hslot2->lock);
  314. hlist_add_head_rcu(&udp_sk(sk)->udp_portaddr_node,
  315. &hslot2->head);
  316. hslot2->count++;
  317. spin_unlock(&hslot2->lock);
  318. }
  319. sock_set_flag(sk, SOCK_RCU_FREE);
  320. error = 0;
  321. fail_unlock:
  322. spin_unlock_bh(&hslot->lock);
  323. fail:
  324. return error;
  325. }
  326. EXPORT_SYMBOL(udp_lib_get_port);
  327. /* match_wildcard == true: 0.0.0.0 equals to any IPv4 addresses
  328. * match_wildcard == false: addresses must be exactly the same, i.e.
  329. * 0.0.0.0 only equals to 0.0.0.0
  330. */
  331. int ipv4_rcv_saddr_equal(const struct sock *sk1, const struct sock *sk2,
  332. bool match_wildcard)
  333. {
  334. struct inet_sock *inet1 = inet_sk(sk1), *inet2 = inet_sk(sk2);
  335. if (!ipv6_only_sock(sk2)) {
  336. if (inet1->inet_rcv_saddr == inet2->inet_rcv_saddr)
  337. return 1;
  338. if (!inet1->inet_rcv_saddr || !inet2->inet_rcv_saddr)
  339. return match_wildcard;
  340. }
  341. return 0;
  342. }
  343. static u32 udp4_portaddr_hash(const struct net *net, __be32 saddr,
  344. unsigned int port)
  345. {
  346. return jhash_1word((__force u32)saddr, net_hash_mix(net)) ^ port;
  347. }
  348. int udp_v4_get_port(struct sock *sk, unsigned short snum)
  349. {
  350. unsigned int hash2_nulladdr =
  351. udp4_portaddr_hash(sock_net(sk), htonl(INADDR_ANY), snum);
  352. unsigned int hash2_partial =
  353. udp4_portaddr_hash(sock_net(sk), inet_sk(sk)->inet_rcv_saddr, 0);
  354. /* precompute partial secondary hash */
  355. udp_sk(sk)->udp_portaddr_hash = hash2_partial;
  356. return udp_lib_get_port(sk, snum, ipv4_rcv_saddr_equal, hash2_nulladdr);
  357. }
  358. static inline int compute_score(struct sock *sk, struct net *net,
  359. __be32 saddr, unsigned short hnum, __be16 sport,
  360. __be32 daddr, __be16 dport, int dif)
  361. {
  362. int score;
  363. struct inet_sock *inet;
  364. if (!net_eq(sock_net(sk), net) ||
  365. udp_sk(sk)->udp_port_hash != hnum ||
  366. ipv6_only_sock(sk))
  367. return -1;
  368. score = (sk->sk_family == PF_INET) ? 2 : 1;
  369. inet = inet_sk(sk);
  370. if (inet->inet_rcv_saddr) {
  371. if (inet->inet_rcv_saddr != daddr)
  372. return -1;
  373. score += 4;
  374. }
  375. if (inet->inet_daddr) {
  376. if (inet->inet_daddr != saddr)
  377. return -1;
  378. score += 4;
  379. }
  380. if (inet->inet_dport) {
  381. if (inet->inet_dport != sport)
  382. return -1;
  383. score += 4;
  384. }
  385. if (sk->sk_bound_dev_if) {
  386. if (sk->sk_bound_dev_if != dif)
  387. return -1;
  388. score += 4;
  389. }
  390. if (sk->sk_incoming_cpu == raw_smp_processor_id())
  391. score++;
  392. return score;
  393. }
  394. /*
  395. * In this second variant, we check (daddr, dport) matches (inet_rcv_sadd, inet_num)
  396. */
  397. static inline int compute_score2(struct sock *sk, struct net *net,
  398. __be32 saddr, __be16 sport,
  399. __be32 daddr, unsigned int hnum, int dif)
  400. {
  401. int score;
  402. struct inet_sock *inet;
  403. if (!net_eq(sock_net(sk), net) ||
  404. ipv6_only_sock(sk))
  405. return -1;
  406. inet = inet_sk(sk);
  407. if (inet->inet_rcv_saddr != daddr ||
  408. inet->inet_num != hnum)
  409. return -1;
  410. score = (sk->sk_family == PF_INET) ? 2 : 1;
  411. if (inet->inet_daddr) {
  412. if (inet->inet_daddr != saddr)
  413. return -1;
  414. score += 4;
  415. }
  416. if (inet->inet_dport) {
  417. if (inet->inet_dport != sport)
  418. return -1;
  419. score += 4;
  420. }
  421. if (sk->sk_bound_dev_if) {
  422. if (sk->sk_bound_dev_if != dif)
  423. return -1;
  424. score += 4;
  425. }
  426. if (sk->sk_incoming_cpu == raw_smp_processor_id())
  427. score++;
  428. return score;
  429. }
  430. static u32 udp_ehashfn(const struct net *net, const __be32 laddr,
  431. const __u16 lport, const __be32 faddr,
  432. const __be16 fport)
  433. {
  434. static u32 udp_ehash_secret __read_mostly;
  435. net_get_random_once(&udp_ehash_secret, sizeof(udp_ehash_secret));
  436. return __inet_ehashfn(laddr, lport, faddr, fport,
  437. udp_ehash_secret + net_hash_mix(net));
  438. }
  439. /* called with read_rcu_lock() */
  440. static struct sock *udp4_lib_lookup2(struct net *net,
  441. __be32 saddr, __be16 sport,
  442. __be32 daddr, unsigned int hnum, int dif,
  443. struct udp_hslot *hslot2, unsigned int slot2,
  444. struct sk_buff *skb)
  445. {
  446. struct sock *sk, *result;
  447. int score, badness, matches = 0, reuseport = 0;
  448. u32 hash = 0;
  449. result = NULL;
  450. badness = 0;
  451. udp_portaddr_for_each_entry_rcu(sk, &hslot2->head) {
  452. score = compute_score2(sk, net, saddr, sport,
  453. daddr, hnum, dif);
  454. if (score > badness) {
  455. reuseport = sk->sk_reuseport;
  456. if (reuseport) {
  457. hash = udp_ehashfn(net, daddr, hnum,
  458. saddr, sport);
  459. result = reuseport_select_sock(sk, hash, skb,
  460. sizeof(struct udphdr));
  461. if (result)
  462. return result;
  463. matches = 1;
  464. }
  465. badness = score;
  466. result = sk;
  467. } else if (score == badness && reuseport) {
  468. matches++;
  469. if (reciprocal_scale(hash, matches) == 0)
  470. result = sk;
  471. hash = next_pseudo_random32(hash);
  472. }
  473. }
  474. return result;
  475. }
  476. /* UDP is nearly always wildcards out the wazoo, it makes no sense to try
  477. * harder than this. -DaveM
  478. */
  479. struct sock *__udp4_lib_lookup(struct net *net, __be32 saddr,
  480. __be16 sport, __be32 daddr, __be16 dport,
  481. int dif, struct udp_table *udptable, struct sk_buff *skb)
  482. {
  483. struct sock *sk, *result;
  484. unsigned short hnum = ntohs(dport);
  485. unsigned int hash2, slot2, slot = udp_hashfn(net, hnum, udptable->mask);
  486. struct udp_hslot *hslot2, *hslot = &udptable->hash[slot];
  487. int score, badness, matches = 0, reuseport = 0;
  488. u32 hash = 0;
  489. if (hslot->count > 10) {
  490. hash2 = udp4_portaddr_hash(net, daddr, hnum);
  491. slot2 = hash2 & udptable->mask;
  492. hslot2 = &udptable->hash2[slot2];
  493. if (hslot->count < hslot2->count)
  494. goto begin;
  495. result = udp4_lib_lookup2(net, saddr, sport,
  496. daddr, hnum, dif,
  497. hslot2, slot2, skb);
  498. if (!result) {
  499. hash2 = udp4_portaddr_hash(net, htonl(INADDR_ANY), hnum);
  500. slot2 = hash2 & udptable->mask;
  501. hslot2 = &udptable->hash2[slot2];
  502. if (hslot->count < hslot2->count)
  503. goto begin;
  504. result = udp4_lib_lookup2(net, saddr, sport,
  505. htonl(INADDR_ANY), hnum, dif,
  506. hslot2, slot2, skb);
  507. }
  508. return result;
  509. }
  510. begin:
  511. result = NULL;
  512. badness = 0;
  513. sk_for_each_rcu(sk, &hslot->head) {
  514. score = compute_score(sk, net, saddr, hnum, sport,
  515. daddr, dport, dif);
  516. if (score > badness) {
  517. reuseport = sk->sk_reuseport;
  518. if (reuseport) {
  519. hash = udp_ehashfn(net, daddr, hnum,
  520. saddr, sport);
  521. result = reuseport_select_sock(sk, hash, skb,
  522. sizeof(struct udphdr));
  523. if (result)
  524. return result;
  525. matches = 1;
  526. }
  527. result = sk;
  528. badness = score;
  529. } else if (score == badness && reuseport) {
  530. matches++;
  531. if (reciprocal_scale(hash, matches) == 0)
  532. result = sk;
  533. hash = next_pseudo_random32(hash);
  534. }
  535. }
  536. return result;
  537. }
  538. EXPORT_SYMBOL_GPL(__udp4_lib_lookup);
  539. static inline struct sock *__udp4_lib_lookup_skb(struct sk_buff *skb,
  540. __be16 sport, __be16 dport,
  541. struct udp_table *udptable)
  542. {
  543. const struct iphdr *iph = ip_hdr(skb);
  544. return __udp4_lib_lookup(dev_net(skb_dst(skb)->dev), iph->saddr, sport,
  545. iph->daddr, dport, inet_iif(skb),
  546. udptable, skb);
  547. }
  548. /* Must be called under rcu_read_lock().
  549. * Does increment socket refcount.
  550. */
  551. #if IS_ENABLED(CONFIG_NETFILTER_XT_MATCH_SOCKET) || \
  552. IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TPROXY)
  553. struct sock *udp4_lib_lookup(struct net *net, __be32 saddr, __be16 sport,
  554. __be32 daddr, __be16 dport, int dif)
  555. {
  556. struct sock *sk;
  557. sk = __udp4_lib_lookup(net, saddr, sport, daddr, dport,
  558. dif, &udp_table, NULL);
  559. if (sk && !atomic_inc_not_zero(&sk->sk_refcnt))
  560. sk = NULL;
  561. return sk;
  562. }
  563. EXPORT_SYMBOL_GPL(udp4_lib_lookup);
  564. #endif
  565. static inline bool __udp_is_mcast_sock(struct net *net, struct sock *sk,
  566. __be16 loc_port, __be32 loc_addr,
  567. __be16 rmt_port, __be32 rmt_addr,
  568. int dif, unsigned short hnum)
  569. {
  570. struct inet_sock *inet = inet_sk(sk);
  571. if (!net_eq(sock_net(sk), net) ||
  572. udp_sk(sk)->udp_port_hash != hnum ||
  573. (inet->inet_daddr && inet->inet_daddr != rmt_addr) ||
  574. (inet->inet_dport != rmt_port && inet->inet_dport) ||
  575. (inet->inet_rcv_saddr && inet->inet_rcv_saddr != loc_addr) ||
  576. ipv6_only_sock(sk) ||
  577. (sk->sk_bound_dev_if && sk->sk_bound_dev_if != dif))
  578. return false;
  579. if (!ip_mc_sf_allow(sk, loc_addr, rmt_addr, dif))
  580. return false;
  581. return true;
  582. }
  583. /*
  584. * This routine is called by the ICMP module when it gets some
  585. * sort of error condition. If err < 0 then the socket should
  586. * be closed and the error returned to the user. If err > 0
  587. * it's just the icmp type << 8 | icmp code.
  588. * Header points to the ip header of the error packet. We move
  589. * on past this. Then (as it used to claim before adjustment)
  590. * header points to the first 8 bytes of the udp header. We need
  591. * to find the appropriate port.
  592. */
  593. void __udp4_lib_err(struct sk_buff *skb, u32 info, struct udp_table *udptable)
  594. {
  595. struct inet_sock *inet;
  596. const struct iphdr *iph = (const struct iphdr *)skb->data;
  597. struct udphdr *uh = (struct udphdr *)(skb->data+(iph->ihl<<2));
  598. const int type = icmp_hdr(skb)->type;
  599. const int code = icmp_hdr(skb)->code;
  600. struct sock *sk;
  601. int harderr;
  602. int err;
  603. struct net *net = dev_net(skb->dev);
  604. sk = __udp4_lib_lookup(net, iph->daddr, uh->dest,
  605. iph->saddr, uh->source, skb->dev->ifindex, udptable,
  606. NULL);
  607. if (!sk) {
  608. ICMP_INC_STATS_BH(net, ICMP_MIB_INERRORS);
  609. return; /* No socket for error */
  610. }
  611. err = 0;
  612. harderr = 0;
  613. inet = inet_sk(sk);
  614. switch (type) {
  615. default:
  616. case ICMP_TIME_EXCEEDED:
  617. err = EHOSTUNREACH;
  618. break;
  619. case ICMP_SOURCE_QUENCH:
  620. goto out;
  621. case ICMP_PARAMETERPROB:
  622. err = EPROTO;
  623. harderr = 1;
  624. break;
  625. case ICMP_DEST_UNREACH:
  626. if (code == ICMP_FRAG_NEEDED) { /* Path MTU discovery */
  627. ipv4_sk_update_pmtu(skb, sk, info);
  628. if (inet->pmtudisc != IP_PMTUDISC_DONT) {
  629. err = EMSGSIZE;
  630. harderr = 1;
  631. break;
  632. }
  633. goto out;
  634. }
  635. err = EHOSTUNREACH;
  636. if (code <= NR_ICMP_UNREACH) {
  637. harderr = icmp_err_convert[code].fatal;
  638. err = icmp_err_convert[code].errno;
  639. }
  640. break;
  641. case ICMP_REDIRECT:
  642. ipv4_sk_redirect(skb, sk);
  643. goto out;
  644. }
  645. /*
  646. * RFC1122: OK. Passes ICMP errors back to application, as per
  647. * 4.1.3.3.
  648. */
  649. if (!inet->recverr) {
  650. if (!harderr || sk->sk_state != TCP_ESTABLISHED)
  651. goto out;
  652. } else
  653. ip_icmp_error(sk, skb, err, uh->dest, info, (u8 *)(uh+1));
  654. sk->sk_err = err;
  655. sk->sk_error_report(sk);
  656. out:
  657. return;
  658. }
  659. void udp_err(struct sk_buff *skb, u32 info)
  660. {
  661. __udp4_lib_err(skb, info, &udp_table);
  662. }
  663. /*
  664. * Throw away all pending data and cancel the corking. Socket is locked.
  665. */
  666. void udp_flush_pending_frames(struct sock *sk)
  667. {
  668. struct udp_sock *up = udp_sk(sk);
  669. if (up->pending) {
  670. up->len = 0;
  671. up->pending = 0;
  672. ip_flush_pending_frames(sk);
  673. }
  674. }
  675. EXPORT_SYMBOL(udp_flush_pending_frames);
  676. /**
  677. * udp4_hwcsum - handle outgoing HW checksumming
  678. * @skb: sk_buff containing the filled-in UDP header
  679. * (checksum field must be zeroed out)
  680. * @src: source IP address
  681. * @dst: destination IP address
  682. */
  683. void udp4_hwcsum(struct sk_buff *skb, __be32 src, __be32 dst)
  684. {
  685. struct udphdr *uh = udp_hdr(skb);
  686. int offset = skb_transport_offset(skb);
  687. int len = skb->len - offset;
  688. int hlen = len;
  689. __wsum csum = 0;
  690. if (!skb_has_frag_list(skb)) {
  691. /*
  692. * Only one fragment on the socket.
  693. */
  694. skb->csum_start = skb_transport_header(skb) - skb->head;
  695. skb->csum_offset = offsetof(struct udphdr, check);
  696. uh->check = ~csum_tcpudp_magic(src, dst, len,
  697. IPPROTO_UDP, 0);
  698. } else {
  699. struct sk_buff *frags;
  700. /*
  701. * HW-checksum won't work as there are two or more
  702. * fragments on the socket so that all csums of sk_buffs
  703. * should be together
  704. */
  705. skb_walk_frags(skb, frags) {
  706. csum = csum_add(csum, frags->csum);
  707. hlen -= frags->len;
  708. }
  709. csum = skb_checksum(skb, offset, hlen, csum);
  710. skb->ip_summed = CHECKSUM_NONE;
  711. uh->check = csum_tcpudp_magic(src, dst, len, IPPROTO_UDP, csum);
  712. if (uh->check == 0)
  713. uh->check = CSUM_MANGLED_0;
  714. }
  715. }
  716. EXPORT_SYMBOL_GPL(udp4_hwcsum);
  717. /* Function to set UDP checksum for an IPv4 UDP packet. This is intended
  718. * for the simple case like when setting the checksum for a UDP tunnel.
  719. */
  720. void udp_set_csum(bool nocheck, struct sk_buff *skb,
  721. __be32 saddr, __be32 daddr, int len)
  722. {
  723. struct udphdr *uh = udp_hdr(skb);
  724. if (nocheck) {
  725. uh->check = 0;
  726. } else if (skb_is_gso(skb)) {
  727. uh->check = ~udp_v4_check(len, saddr, daddr, 0);
  728. } else if (skb->ip_summed == CHECKSUM_PARTIAL) {
  729. uh->check = 0;
  730. uh->check = udp_v4_check(len, saddr, daddr, lco_csum(skb));
  731. if (uh->check == 0)
  732. uh->check = CSUM_MANGLED_0;
  733. } else {
  734. skb->ip_summed = CHECKSUM_PARTIAL;
  735. skb->csum_start = skb_transport_header(skb) - skb->head;
  736. skb->csum_offset = offsetof(struct udphdr, check);
  737. uh->check = ~udp_v4_check(len, saddr, daddr, 0);
  738. }
  739. }
  740. EXPORT_SYMBOL(udp_set_csum);
  741. static int udp_send_skb(struct sk_buff *skb, struct flowi4 *fl4)
  742. {
  743. struct sock *sk = skb->sk;
  744. struct inet_sock *inet = inet_sk(sk);
  745. struct udphdr *uh;
  746. int err = 0;
  747. int is_udplite = IS_UDPLITE(sk);
  748. int offset = skb_transport_offset(skb);
  749. int len = skb->len - offset;
  750. __wsum csum = 0;
  751. /*
  752. * Create a UDP header
  753. */
  754. uh = udp_hdr(skb);
  755. uh->source = inet->inet_sport;
  756. uh->dest = fl4->fl4_dport;
  757. uh->len = htons(len);
  758. uh->check = 0;
  759. if (is_udplite) /* UDP-Lite */
  760. csum = udplite_csum(skb);
  761. else if (sk->sk_no_check_tx) { /* UDP csum disabled */
  762. skb->ip_summed = CHECKSUM_NONE;
  763. goto send;
  764. } else if (skb->ip_summed == CHECKSUM_PARTIAL) { /* UDP hardware csum */
  765. udp4_hwcsum(skb, fl4->saddr, fl4->daddr);
  766. goto send;
  767. } else
  768. csum = udp_csum(skb);
  769. /* add protocol-dependent pseudo-header */
  770. uh->check = csum_tcpudp_magic(fl4->saddr, fl4->daddr, len,
  771. sk->sk_protocol, csum);
  772. if (uh->check == 0)
  773. uh->check = CSUM_MANGLED_0;
  774. send:
  775. err = ip_send_skb(sock_net(sk), skb);
  776. if (err) {
  777. if (err == -ENOBUFS && !inet->recverr) {
  778. UDP_INC_STATS_USER(sock_net(sk),
  779. UDP_MIB_SNDBUFERRORS, is_udplite);
  780. err = 0;
  781. }
  782. } else
  783. UDP_INC_STATS_USER(sock_net(sk),
  784. UDP_MIB_OUTDATAGRAMS, is_udplite);
  785. return err;
  786. }
  787. /*
  788. * Push out all pending data as one UDP datagram. Socket is locked.
  789. */
  790. int udp_push_pending_frames(struct sock *sk)
  791. {
  792. struct udp_sock *up = udp_sk(sk);
  793. struct inet_sock *inet = inet_sk(sk);
  794. struct flowi4 *fl4 = &inet->cork.fl.u.ip4;
  795. struct sk_buff *skb;
  796. int err = 0;
  797. skb = ip_finish_skb(sk, fl4);
  798. if (!skb)
  799. goto out;
  800. err = udp_send_skb(skb, fl4);
  801. out:
  802. up->len = 0;
  803. up->pending = 0;
  804. return err;
  805. }
  806. EXPORT_SYMBOL(udp_push_pending_frames);
  807. int udp_sendmsg(struct sock *sk, struct msghdr *msg, size_t len)
  808. {
  809. struct inet_sock *inet = inet_sk(sk);
  810. struct udp_sock *up = udp_sk(sk);
  811. struct flowi4 fl4_stack;
  812. struct flowi4 *fl4;
  813. int ulen = len;
  814. struct ipcm_cookie ipc;
  815. struct rtable *rt = NULL;
  816. int free = 0;
  817. int connected = 0;
  818. __be32 daddr, faddr, saddr;
  819. __be16 dport;
  820. u8 tos;
  821. int err, is_udplite = IS_UDPLITE(sk);
  822. int corkreq = up->corkflag || msg->msg_flags&MSG_MORE;
  823. int (*getfrag)(void *, char *, int, int, int, struct sk_buff *);
  824. struct sk_buff *skb;
  825. struct ip_options_data opt_copy;
  826. if (len > 0xFFFF)
  827. return -EMSGSIZE;
  828. /*
  829. * Check the flags.
  830. */
  831. if (msg->msg_flags & MSG_OOB) /* Mirror BSD error message compatibility */
  832. return -EOPNOTSUPP;
  833. ipc.opt = NULL;
  834. ipc.tx_flags = 0;
  835. ipc.ttl = 0;
  836. ipc.tos = -1;
  837. getfrag = is_udplite ? udplite_getfrag : ip_generic_getfrag;
  838. fl4 = &inet->cork.fl.u.ip4;
  839. if (up->pending) {
  840. /*
  841. * There are pending frames.
  842. * The socket lock must be held while it's corked.
  843. */
  844. lock_sock(sk);
  845. if (likely(up->pending)) {
  846. if (unlikely(up->pending != AF_INET)) {
  847. release_sock(sk);
  848. return -EINVAL;
  849. }
  850. goto do_append_data;
  851. }
  852. release_sock(sk);
  853. }
  854. ulen += sizeof(struct udphdr);
  855. /*
  856. * Get and verify the address.
  857. */
  858. if (msg->msg_name) {
  859. DECLARE_SOCKADDR(struct sockaddr_in *, usin, msg->msg_name);
  860. if (msg->msg_namelen < sizeof(*usin))
  861. return -EINVAL;
  862. if (usin->sin_family != AF_INET) {
  863. if (usin->sin_family != AF_UNSPEC)
  864. return -EAFNOSUPPORT;
  865. }
  866. daddr = usin->sin_addr.s_addr;
  867. dport = usin->sin_port;
  868. if (dport == 0)
  869. return -EINVAL;
  870. } else {
  871. if (sk->sk_state != TCP_ESTABLISHED)
  872. return -EDESTADDRREQ;
  873. daddr = inet->inet_daddr;
  874. dport = inet->inet_dport;
  875. /* Open fast path for connected socket.
  876. Route will not be used, if at least one option is set.
  877. */
  878. connected = 1;
  879. }
  880. ipc.sockc.tsflags = sk->sk_tsflags;
  881. ipc.addr = inet->inet_saddr;
  882. ipc.oif = sk->sk_bound_dev_if;
  883. if (msg->msg_controllen) {
  884. err = ip_cmsg_send(sk, msg, &ipc, sk->sk_family == AF_INET6);
  885. if (unlikely(err)) {
  886. kfree(ipc.opt);
  887. return err;
  888. }
  889. if (ipc.opt)
  890. free = 1;
  891. connected = 0;
  892. }
  893. if (!ipc.opt) {
  894. struct ip_options_rcu *inet_opt;
  895. rcu_read_lock();
  896. inet_opt = rcu_dereference(inet->inet_opt);
  897. if (inet_opt) {
  898. memcpy(&opt_copy, inet_opt,
  899. sizeof(*inet_opt) + inet_opt->opt.optlen);
  900. ipc.opt = &opt_copy.opt;
  901. }
  902. rcu_read_unlock();
  903. }
  904. saddr = ipc.addr;
  905. ipc.addr = faddr = daddr;
  906. sock_tx_timestamp(sk, ipc.sockc.tsflags, &ipc.tx_flags);
  907. if (ipc.opt && ipc.opt->opt.srr) {
  908. if (!daddr)
  909. return -EINVAL;
  910. faddr = ipc.opt->opt.faddr;
  911. connected = 0;
  912. }
  913. tos = get_rttos(&ipc, inet);
  914. if (sock_flag(sk, SOCK_LOCALROUTE) ||
  915. (msg->msg_flags & MSG_DONTROUTE) ||
  916. (ipc.opt && ipc.opt->opt.is_strictroute)) {
  917. tos |= RTO_ONLINK;
  918. connected = 0;
  919. }
  920. if (ipv4_is_multicast(daddr)) {
  921. if (!ipc.oif)
  922. ipc.oif = inet->mc_index;
  923. if (!saddr)
  924. saddr = inet->mc_addr;
  925. connected = 0;
  926. } else if (!ipc.oif)
  927. ipc.oif = inet->uc_index;
  928. if (connected)
  929. rt = (struct rtable *)sk_dst_check(sk, 0);
  930. if (!rt) {
  931. struct net *net = sock_net(sk);
  932. __u8 flow_flags = inet_sk_flowi_flags(sk);
  933. fl4 = &fl4_stack;
  934. flowi4_init_output(fl4, ipc.oif, sk->sk_mark, tos,
  935. RT_SCOPE_UNIVERSE, sk->sk_protocol,
  936. flow_flags,
  937. faddr, saddr, dport, inet->inet_sport);
  938. if (!saddr && ipc.oif) {
  939. err = l3mdev_get_saddr(net, ipc.oif, fl4);
  940. if (err < 0)
  941. goto out;
  942. }
  943. security_sk_classify_flow(sk, flowi4_to_flowi(fl4));
  944. rt = ip_route_output_flow(net, fl4, sk);
  945. if (IS_ERR(rt)) {
  946. err = PTR_ERR(rt);
  947. rt = NULL;
  948. if (err == -ENETUNREACH)
  949. IP_INC_STATS(net, IPSTATS_MIB_OUTNOROUTES);
  950. goto out;
  951. }
  952. err = -EACCES;
  953. if ((rt->rt_flags & RTCF_BROADCAST) &&
  954. !sock_flag(sk, SOCK_BROADCAST))
  955. goto out;
  956. if (connected)
  957. sk_dst_set(sk, dst_clone(&rt->dst));
  958. }
  959. if (msg->msg_flags&MSG_CONFIRM)
  960. goto do_confirm;
  961. back_from_confirm:
  962. saddr = fl4->saddr;
  963. if (!ipc.addr)
  964. daddr = ipc.addr = fl4->daddr;
  965. /* Lockless fast path for the non-corking case. */
  966. if (!corkreq) {
  967. skb = ip_make_skb(sk, fl4, getfrag, msg, ulen,
  968. sizeof(struct udphdr), &ipc, &rt,
  969. msg->msg_flags);
  970. err = PTR_ERR(skb);
  971. if (!IS_ERR_OR_NULL(skb))
  972. err = udp_send_skb(skb, fl4);
  973. goto out;
  974. }
  975. lock_sock(sk);
  976. if (unlikely(up->pending)) {
  977. /* The socket is already corked while preparing it. */
  978. /* ... which is an evident application bug. --ANK */
  979. release_sock(sk);
  980. net_dbg_ratelimited("cork app bug 2\n");
  981. err = -EINVAL;
  982. goto out;
  983. }
  984. /*
  985. * Now cork the socket to pend data.
  986. */
  987. fl4 = &inet->cork.fl.u.ip4;
  988. fl4->daddr = daddr;
  989. fl4->saddr = saddr;
  990. fl4->fl4_dport = dport;
  991. fl4->fl4_sport = inet->inet_sport;
  992. up->pending = AF_INET;
  993. do_append_data:
  994. up->len += ulen;
  995. err = ip_append_data(sk, fl4, getfrag, msg, ulen,
  996. sizeof(struct udphdr), &ipc, &rt,
  997. corkreq ? msg->msg_flags|MSG_MORE : msg->msg_flags);
  998. if (err)
  999. udp_flush_pending_frames(sk);
  1000. else if (!corkreq)
  1001. err = udp_push_pending_frames(sk);
  1002. else if (unlikely(skb_queue_empty(&sk->sk_write_queue)))
  1003. up->pending = 0;
  1004. release_sock(sk);
  1005. out:
  1006. ip_rt_put(rt);
  1007. if (free)
  1008. kfree(ipc.opt);
  1009. if (!err)
  1010. return len;
  1011. /*
  1012. * ENOBUFS = no kernel mem, SOCK_NOSPACE = no sndbuf space. Reporting
  1013. * ENOBUFS might not be good (it's not tunable per se), but otherwise
  1014. * we don't have a good statistic (IpOutDiscards but it can be too many
  1015. * things). We could add another new stat but at least for now that
  1016. * seems like overkill.
  1017. */
  1018. if (err == -ENOBUFS || test_bit(SOCK_NOSPACE, &sk->sk_socket->flags)) {
  1019. UDP_INC_STATS_USER(sock_net(sk),
  1020. UDP_MIB_SNDBUFERRORS, is_udplite);
  1021. }
  1022. return err;
  1023. do_confirm:
  1024. dst_confirm(&rt->dst);
  1025. if (!(msg->msg_flags&MSG_PROBE) || len)
  1026. goto back_from_confirm;
  1027. err = 0;
  1028. goto out;
  1029. }
  1030. EXPORT_SYMBOL(udp_sendmsg);
  1031. int udp_sendpage(struct sock *sk, struct page *page, int offset,
  1032. size_t size, int flags)
  1033. {
  1034. struct inet_sock *inet = inet_sk(sk);
  1035. struct udp_sock *up = udp_sk(sk);
  1036. int ret;
  1037. if (flags & MSG_SENDPAGE_NOTLAST)
  1038. flags |= MSG_MORE;
  1039. if (!up->pending) {
  1040. struct msghdr msg = { .msg_flags = flags|MSG_MORE };
  1041. /* Call udp_sendmsg to specify destination address which
  1042. * sendpage interface can't pass.
  1043. * This will succeed only when the socket is connected.
  1044. */
  1045. ret = udp_sendmsg(sk, &msg, 0);
  1046. if (ret < 0)
  1047. return ret;
  1048. }
  1049. lock_sock(sk);
  1050. if (unlikely(!up->pending)) {
  1051. release_sock(sk);
  1052. net_dbg_ratelimited("udp cork app bug 3\n");
  1053. return -EINVAL;
  1054. }
  1055. ret = ip_append_page(sk, &inet->cork.fl.u.ip4,
  1056. page, offset, size, flags);
  1057. if (ret == -EOPNOTSUPP) {
  1058. release_sock(sk);
  1059. return sock_no_sendpage(sk->sk_socket, page, offset,
  1060. size, flags);
  1061. }
  1062. if (ret < 0) {
  1063. udp_flush_pending_frames(sk);
  1064. goto out;
  1065. }
  1066. up->len += size;
  1067. if (!(up->corkflag || (flags&MSG_MORE)))
  1068. ret = udp_push_pending_frames(sk);
  1069. if (!ret)
  1070. ret = size;
  1071. out:
  1072. release_sock(sk);
  1073. return ret;
  1074. }
  1075. /**
  1076. * first_packet_length - return length of first packet in receive queue
  1077. * @sk: socket
  1078. *
  1079. * Drops all bad checksum frames, until a valid one is found.
  1080. * Returns the length of found skb, or 0 if none is found.
  1081. */
  1082. static unsigned int first_packet_length(struct sock *sk)
  1083. {
  1084. struct sk_buff_head list_kill, *rcvq = &sk->sk_receive_queue;
  1085. struct sk_buff *skb;
  1086. unsigned int res;
  1087. __skb_queue_head_init(&list_kill);
  1088. spin_lock_bh(&rcvq->lock);
  1089. while ((skb = skb_peek(rcvq)) != NULL &&
  1090. udp_lib_checksum_complete(skb)) {
  1091. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_CSUMERRORS,
  1092. IS_UDPLITE(sk));
  1093. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS,
  1094. IS_UDPLITE(sk));
  1095. atomic_inc(&sk->sk_drops);
  1096. __skb_unlink(skb, rcvq);
  1097. __skb_queue_tail(&list_kill, skb);
  1098. }
  1099. res = skb ? skb->len : 0;
  1100. spin_unlock_bh(&rcvq->lock);
  1101. if (!skb_queue_empty(&list_kill)) {
  1102. bool slow = lock_sock_fast(sk);
  1103. __skb_queue_purge(&list_kill);
  1104. sk_mem_reclaim_partial(sk);
  1105. unlock_sock_fast(sk, slow);
  1106. }
  1107. return res;
  1108. }
  1109. /*
  1110. * IOCTL requests applicable to the UDP protocol
  1111. */
  1112. int udp_ioctl(struct sock *sk, int cmd, unsigned long arg)
  1113. {
  1114. switch (cmd) {
  1115. case SIOCOUTQ:
  1116. {
  1117. int amount = sk_wmem_alloc_get(sk);
  1118. return put_user(amount, (int __user *)arg);
  1119. }
  1120. case SIOCINQ:
  1121. {
  1122. unsigned int amount = first_packet_length(sk);
  1123. if (amount)
  1124. /*
  1125. * We will only return the amount
  1126. * of this packet since that is all
  1127. * that will be read.
  1128. */
  1129. amount -= sizeof(struct udphdr);
  1130. return put_user(amount, (int __user *)arg);
  1131. }
  1132. default:
  1133. return -ENOIOCTLCMD;
  1134. }
  1135. return 0;
  1136. }
  1137. EXPORT_SYMBOL(udp_ioctl);
  1138. /*
  1139. * This should be easy, if there is something there we
  1140. * return it, otherwise we block.
  1141. */
  1142. int udp_recvmsg(struct sock *sk, struct msghdr *msg, size_t len, int noblock,
  1143. int flags, int *addr_len)
  1144. {
  1145. struct inet_sock *inet = inet_sk(sk);
  1146. DECLARE_SOCKADDR(struct sockaddr_in *, sin, msg->msg_name);
  1147. struct sk_buff *skb;
  1148. unsigned int ulen, copied;
  1149. int peeked, off = 0;
  1150. int err;
  1151. int is_udplite = IS_UDPLITE(sk);
  1152. bool checksum_valid = false;
  1153. bool slow;
  1154. if (flags & MSG_ERRQUEUE)
  1155. return ip_recv_error(sk, msg, len, addr_len);
  1156. try_again:
  1157. skb = __skb_recv_datagram(sk, flags | (noblock ? MSG_DONTWAIT : 0),
  1158. &peeked, &off, &err);
  1159. if (!skb)
  1160. goto out;
  1161. ulen = skb->len - sizeof(struct udphdr);
  1162. copied = len;
  1163. if (copied > ulen)
  1164. copied = ulen;
  1165. else if (copied < ulen)
  1166. msg->msg_flags |= MSG_TRUNC;
  1167. /*
  1168. * If checksum is needed at all, try to do it while copying the
  1169. * data. If the data is truncated, or if we only want a partial
  1170. * coverage checksum (UDP-Lite), do it before the copy.
  1171. */
  1172. if (copied < ulen || UDP_SKB_CB(skb)->partial_cov) {
  1173. checksum_valid = !udp_lib_checksum_complete(skb);
  1174. if (!checksum_valid)
  1175. goto csum_copy_err;
  1176. }
  1177. if (checksum_valid || skb_csum_unnecessary(skb))
  1178. err = skb_copy_datagram_msg(skb, sizeof(struct udphdr),
  1179. msg, copied);
  1180. else {
  1181. err = skb_copy_and_csum_datagram_msg(skb, sizeof(struct udphdr),
  1182. msg);
  1183. if (err == -EINVAL)
  1184. goto csum_copy_err;
  1185. }
  1186. if (unlikely(err)) {
  1187. trace_kfree_skb(skb, udp_recvmsg);
  1188. if (!peeked) {
  1189. atomic_inc(&sk->sk_drops);
  1190. UDP_INC_STATS_USER(sock_net(sk),
  1191. UDP_MIB_INERRORS, is_udplite);
  1192. }
  1193. goto out_free;
  1194. }
  1195. if (!peeked)
  1196. UDP_INC_STATS_USER(sock_net(sk),
  1197. UDP_MIB_INDATAGRAMS, is_udplite);
  1198. sock_recv_ts_and_drops(msg, sk, skb);
  1199. /* Copy the address. */
  1200. if (sin) {
  1201. sin->sin_family = AF_INET;
  1202. sin->sin_port = udp_hdr(skb)->source;
  1203. sin->sin_addr.s_addr = ip_hdr(skb)->saddr;
  1204. memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
  1205. *addr_len = sizeof(*sin);
  1206. }
  1207. if (inet->cmsg_flags)
  1208. ip_cmsg_recv_offset(msg, skb, sizeof(struct udphdr));
  1209. err = copied;
  1210. if (flags & MSG_TRUNC)
  1211. err = ulen;
  1212. out_free:
  1213. skb_free_datagram_locked(sk, skb);
  1214. out:
  1215. return err;
  1216. csum_copy_err:
  1217. slow = lock_sock_fast(sk);
  1218. if (!skb_kill_datagram(sk, skb, flags)) {
  1219. UDP_INC_STATS_USER(sock_net(sk), UDP_MIB_CSUMERRORS, is_udplite);
  1220. UDP_INC_STATS_USER(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
  1221. }
  1222. unlock_sock_fast(sk, slow);
  1223. /* starting over for a new packet, but check if we need to yield */
  1224. cond_resched();
  1225. msg->msg_flags &= ~MSG_TRUNC;
  1226. goto try_again;
  1227. }
  1228. int udp_disconnect(struct sock *sk, int flags)
  1229. {
  1230. struct inet_sock *inet = inet_sk(sk);
  1231. /*
  1232. * 1003.1g - break association.
  1233. */
  1234. sk->sk_state = TCP_CLOSE;
  1235. inet->inet_daddr = 0;
  1236. inet->inet_dport = 0;
  1237. sock_rps_reset_rxhash(sk);
  1238. sk->sk_bound_dev_if = 0;
  1239. if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
  1240. inet_reset_saddr(sk);
  1241. if (!(sk->sk_userlocks & SOCK_BINDPORT_LOCK)) {
  1242. sk->sk_prot->unhash(sk);
  1243. inet->inet_sport = 0;
  1244. }
  1245. sk_dst_reset(sk);
  1246. return 0;
  1247. }
  1248. EXPORT_SYMBOL(udp_disconnect);
  1249. void udp_lib_unhash(struct sock *sk)
  1250. {
  1251. if (sk_hashed(sk)) {
  1252. struct udp_table *udptable = sk->sk_prot->h.udp_table;
  1253. struct udp_hslot *hslot, *hslot2;
  1254. hslot = udp_hashslot(udptable, sock_net(sk),
  1255. udp_sk(sk)->udp_port_hash);
  1256. hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
  1257. spin_lock_bh(&hslot->lock);
  1258. if (rcu_access_pointer(sk->sk_reuseport_cb))
  1259. reuseport_detach_sock(sk);
  1260. if (sk_del_node_init_rcu(sk)) {
  1261. hslot->count--;
  1262. inet_sk(sk)->inet_num = 0;
  1263. sock_prot_inuse_add(sock_net(sk), sk->sk_prot, -1);
  1264. spin_lock(&hslot2->lock);
  1265. hlist_del_init_rcu(&udp_sk(sk)->udp_portaddr_node);
  1266. hslot2->count--;
  1267. spin_unlock(&hslot2->lock);
  1268. }
  1269. spin_unlock_bh(&hslot->lock);
  1270. }
  1271. }
  1272. EXPORT_SYMBOL(udp_lib_unhash);
  1273. /*
  1274. * inet_rcv_saddr was changed, we must rehash secondary hash
  1275. */
  1276. void udp_lib_rehash(struct sock *sk, u16 newhash)
  1277. {
  1278. if (sk_hashed(sk)) {
  1279. struct udp_table *udptable = sk->sk_prot->h.udp_table;
  1280. struct udp_hslot *hslot, *hslot2, *nhslot2;
  1281. hslot2 = udp_hashslot2(udptable, udp_sk(sk)->udp_portaddr_hash);
  1282. nhslot2 = udp_hashslot2(udptable, newhash);
  1283. udp_sk(sk)->udp_portaddr_hash = newhash;
  1284. if (hslot2 != nhslot2 ||
  1285. rcu_access_pointer(sk->sk_reuseport_cb)) {
  1286. hslot = udp_hashslot(udptable, sock_net(sk),
  1287. udp_sk(sk)->udp_port_hash);
  1288. /* we must lock primary chain too */
  1289. spin_lock_bh(&hslot->lock);
  1290. if (rcu_access_pointer(sk->sk_reuseport_cb))
  1291. reuseport_detach_sock(sk);
  1292. if (hslot2 != nhslot2) {
  1293. spin_lock(&hslot2->lock);
  1294. hlist_del_init_rcu(&udp_sk(sk)->udp_portaddr_node);
  1295. hslot2->count--;
  1296. spin_unlock(&hslot2->lock);
  1297. spin_lock(&nhslot2->lock);
  1298. hlist_add_head_rcu(&udp_sk(sk)->udp_portaddr_node,
  1299. &nhslot2->head);
  1300. nhslot2->count++;
  1301. spin_unlock(&nhslot2->lock);
  1302. }
  1303. spin_unlock_bh(&hslot->lock);
  1304. }
  1305. }
  1306. }
  1307. EXPORT_SYMBOL(udp_lib_rehash);
  1308. static void udp_v4_rehash(struct sock *sk)
  1309. {
  1310. u16 new_hash = udp4_portaddr_hash(sock_net(sk),
  1311. inet_sk(sk)->inet_rcv_saddr,
  1312. inet_sk(sk)->inet_num);
  1313. udp_lib_rehash(sk, new_hash);
  1314. }
  1315. static int __udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
  1316. {
  1317. int rc;
  1318. if (inet_sk(sk)->inet_daddr) {
  1319. sock_rps_save_rxhash(sk, skb);
  1320. sk_mark_napi_id(sk, skb);
  1321. sk_incoming_cpu_update(sk);
  1322. }
  1323. rc = sock_queue_rcv_skb(sk, skb);
  1324. if (rc < 0) {
  1325. int is_udplite = IS_UDPLITE(sk);
  1326. /* Note that an ENOMEM error is charged twice */
  1327. if (rc == -ENOMEM)
  1328. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
  1329. is_udplite);
  1330. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
  1331. kfree_skb(skb);
  1332. trace_udp_fail_queue_rcv_skb(rc, sk);
  1333. return -1;
  1334. }
  1335. return 0;
  1336. }
  1337. static struct static_key udp_encap_needed __read_mostly;
  1338. void udp_encap_enable(void)
  1339. {
  1340. if (!static_key_enabled(&udp_encap_needed))
  1341. static_key_slow_inc(&udp_encap_needed);
  1342. }
  1343. EXPORT_SYMBOL(udp_encap_enable);
  1344. /* returns:
  1345. * -1: error
  1346. * 0: success
  1347. * >0: "udp encap" protocol resubmission
  1348. *
  1349. * Note that in the success and error cases, the skb is assumed to
  1350. * have either been requeued or freed.
  1351. */
  1352. int udp_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
  1353. {
  1354. struct udp_sock *up = udp_sk(sk);
  1355. int rc;
  1356. int is_udplite = IS_UDPLITE(sk);
  1357. /*
  1358. * Charge it to the socket, dropping if the queue is full.
  1359. */
  1360. if (!xfrm4_policy_check(sk, XFRM_POLICY_IN, skb))
  1361. goto drop;
  1362. nf_reset(skb);
  1363. if (static_key_false(&udp_encap_needed) && up->encap_type) {
  1364. int (*encap_rcv)(struct sock *sk, struct sk_buff *skb);
  1365. /*
  1366. * This is an encapsulation socket so pass the skb to
  1367. * the socket's udp_encap_rcv() hook. Otherwise, just
  1368. * fall through and pass this up the UDP socket.
  1369. * up->encap_rcv() returns the following value:
  1370. * =0 if skb was successfully passed to the encap
  1371. * handler or was discarded by it.
  1372. * >0 if skb should be passed on to UDP.
  1373. * <0 if skb should be resubmitted as proto -N
  1374. */
  1375. /* if we're overly short, let UDP handle it */
  1376. encap_rcv = ACCESS_ONCE(up->encap_rcv);
  1377. if (skb->len > sizeof(struct udphdr) && encap_rcv) {
  1378. int ret;
  1379. /* Verify checksum before giving to encap */
  1380. if (udp_lib_checksum_complete(skb))
  1381. goto csum_error;
  1382. ret = encap_rcv(sk, skb);
  1383. if (ret <= 0) {
  1384. UDP_INC_STATS_BH(sock_net(sk),
  1385. UDP_MIB_INDATAGRAMS,
  1386. is_udplite);
  1387. return -ret;
  1388. }
  1389. }
  1390. /* FALLTHROUGH -- it's a UDP Packet */
  1391. }
  1392. /*
  1393. * UDP-Lite specific tests, ignored on UDP sockets
  1394. */
  1395. if ((is_udplite & UDPLITE_RECV_CC) && UDP_SKB_CB(skb)->partial_cov) {
  1396. /*
  1397. * MIB statistics other than incrementing the error count are
  1398. * disabled for the following two types of errors: these depend
  1399. * on the application settings, not on the functioning of the
  1400. * protocol stack as such.
  1401. *
  1402. * RFC 3828 here recommends (sec 3.3): "There should also be a
  1403. * way ... to ... at least let the receiving application block
  1404. * delivery of packets with coverage values less than a value
  1405. * provided by the application."
  1406. */
  1407. if (up->pcrlen == 0) { /* full coverage was set */
  1408. net_dbg_ratelimited("UDPLite: partial coverage %d while full coverage %d requested\n",
  1409. UDP_SKB_CB(skb)->cscov, skb->len);
  1410. goto drop;
  1411. }
  1412. /* The next case involves violating the min. coverage requested
  1413. * by the receiver. This is subtle: if receiver wants x and x is
  1414. * greater than the buffersize/MTU then receiver will complain
  1415. * that it wants x while sender emits packets of smaller size y.
  1416. * Therefore the above ...()->partial_cov statement is essential.
  1417. */
  1418. if (UDP_SKB_CB(skb)->cscov < up->pcrlen) {
  1419. net_dbg_ratelimited("UDPLite: coverage %d too small, need min %d\n",
  1420. UDP_SKB_CB(skb)->cscov, up->pcrlen);
  1421. goto drop;
  1422. }
  1423. }
  1424. if (rcu_access_pointer(sk->sk_filter) &&
  1425. udp_lib_checksum_complete(skb))
  1426. goto csum_error;
  1427. if (sk_rcvqueues_full(sk, sk->sk_rcvbuf)) {
  1428. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_RCVBUFERRORS,
  1429. is_udplite);
  1430. goto drop;
  1431. }
  1432. rc = 0;
  1433. ipv4_pktinfo_prepare(sk, skb);
  1434. bh_lock_sock(sk);
  1435. if (!sock_owned_by_user(sk))
  1436. rc = __udp_queue_rcv_skb(sk, skb);
  1437. else if (sk_add_backlog(sk, skb, sk->sk_rcvbuf)) {
  1438. bh_unlock_sock(sk);
  1439. goto drop;
  1440. }
  1441. bh_unlock_sock(sk);
  1442. return rc;
  1443. csum_error:
  1444. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_CSUMERRORS, is_udplite);
  1445. drop:
  1446. UDP_INC_STATS_BH(sock_net(sk), UDP_MIB_INERRORS, is_udplite);
  1447. atomic_inc(&sk->sk_drops);
  1448. kfree_skb(skb);
  1449. return -1;
  1450. }
  1451. /* For TCP sockets, sk_rx_dst is protected by socket lock
  1452. * For UDP, we use xchg() to guard against concurrent changes.
  1453. */
  1454. static void udp_sk_rx_dst_set(struct sock *sk, struct dst_entry *dst)
  1455. {
  1456. struct dst_entry *old;
  1457. dst_hold(dst);
  1458. old = xchg(&sk->sk_rx_dst, dst);
  1459. dst_release(old);
  1460. }
  1461. /*
  1462. * Multicasts and broadcasts go to each listener.
  1463. *
  1464. * Note: called only from the BH handler context.
  1465. */
  1466. static int __udp4_lib_mcast_deliver(struct net *net, struct sk_buff *skb,
  1467. struct udphdr *uh,
  1468. __be32 saddr, __be32 daddr,
  1469. struct udp_table *udptable,
  1470. int proto)
  1471. {
  1472. struct sock *sk, *first = NULL;
  1473. unsigned short hnum = ntohs(uh->dest);
  1474. struct udp_hslot *hslot = udp_hashslot(udptable, net, hnum);
  1475. unsigned int hash2 = 0, hash2_any = 0, use_hash2 = (hslot->count > 10);
  1476. unsigned int offset = offsetof(typeof(*sk), sk_node);
  1477. int dif = skb->dev->ifindex;
  1478. struct hlist_node *node;
  1479. struct sk_buff *nskb;
  1480. if (use_hash2) {
  1481. hash2_any = udp4_portaddr_hash(net, htonl(INADDR_ANY), hnum) &
  1482. udp_table.mask;
  1483. hash2 = udp4_portaddr_hash(net, daddr, hnum) & udp_table.mask;
  1484. start_lookup:
  1485. hslot = &udp_table.hash2[hash2];
  1486. offset = offsetof(typeof(*sk), __sk_common.skc_portaddr_node);
  1487. }
  1488. sk_for_each_entry_offset_rcu(sk, node, &hslot->head, offset) {
  1489. if (!__udp_is_mcast_sock(net, sk, uh->dest, daddr,
  1490. uh->source, saddr, dif, hnum))
  1491. continue;
  1492. if (!first) {
  1493. first = sk;
  1494. continue;
  1495. }
  1496. nskb = skb_clone(skb, GFP_ATOMIC);
  1497. if (unlikely(!nskb)) {
  1498. atomic_inc(&sk->sk_drops);
  1499. UDP_INC_STATS_BH(net, UDP_MIB_RCVBUFERRORS,
  1500. IS_UDPLITE(sk));
  1501. UDP_INC_STATS_BH(net, UDP_MIB_INERRORS,
  1502. IS_UDPLITE(sk));
  1503. continue;
  1504. }
  1505. if (udp_queue_rcv_skb(sk, nskb) > 0)
  1506. consume_skb(nskb);
  1507. }
  1508. /* Also lookup *:port if we are using hash2 and haven't done so yet. */
  1509. if (use_hash2 && hash2 != hash2_any) {
  1510. hash2 = hash2_any;
  1511. goto start_lookup;
  1512. }
  1513. if (first) {
  1514. if (udp_queue_rcv_skb(first, skb) > 0)
  1515. consume_skb(skb);
  1516. } else {
  1517. kfree_skb(skb);
  1518. UDP_INC_STATS_BH(net, UDP_MIB_IGNOREDMULTI,
  1519. proto == IPPROTO_UDPLITE);
  1520. }
  1521. return 0;
  1522. }
  1523. /* Initialize UDP checksum. If exited with zero value (success),
  1524. * CHECKSUM_UNNECESSARY means, that no more checks are required.
  1525. * Otherwise, csum completion requires chacksumming packet body,
  1526. * including udp header and folding it to skb->csum.
  1527. */
  1528. static inline int udp4_csum_init(struct sk_buff *skb, struct udphdr *uh,
  1529. int proto)
  1530. {
  1531. int err;
  1532. UDP_SKB_CB(skb)->partial_cov = 0;
  1533. UDP_SKB_CB(skb)->cscov = skb->len;
  1534. if (proto == IPPROTO_UDPLITE) {
  1535. err = udplite_checksum_init(skb, uh);
  1536. if (err)
  1537. return err;
  1538. }
  1539. return skb_checksum_init_zero_check(skb, proto, uh->check,
  1540. inet_compute_pseudo);
  1541. }
  1542. /*
  1543. * All we need to do is get the socket, and then do a checksum.
  1544. */
  1545. int __udp4_lib_rcv(struct sk_buff *skb, struct udp_table *udptable,
  1546. int proto)
  1547. {
  1548. struct sock *sk;
  1549. struct udphdr *uh;
  1550. unsigned short ulen;
  1551. struct rtable *rt = skb_rtable(skb);
  1552. __be32 saddr, daddr;
  1553. struct net *net = dev_net(skb->dev);
  1554. /*
  1555. * Validate the packet.
  1556. */
  1557. if (!pskb_may_pull(skb, sizeof(struct udphdr)))
  1558. goto drop; /* No space for header. */
  1559. uh = udp_hdr(skb);
  1560. ulen = ntohs(uh->len);
  1561. saddr = ip_hdr(skb)->saddr;
  1562. daddr = ip_hdr(skb)->daddr;
  1563. if (ulen > skb->len)
  1564. goto short_packet;
  1565. if (proto == IPPROTO_UDP) {
  1566. /* UDP validates ulen. */
  1567. if (ulen < sizeof(*uh) || pskb_trim_rcsum(skb, ulen))
  1568. goto short_packet;
  1569. uh = udp_hdr(skb);
  1570. }
  1571. if (udp4_csum_init(skb, uh, proto))
  1572. goto csum_error;
  1573. sk = skb_steal_sock(skb);
  1574. if (sk) {
  1575. struct dst_entry *dst = skb_dst(skb);
  1576. int ret;
  1577. if (unlikely(sk->sk_rx_dst != dst))
  1578. udp_sk_rx_dst_set(sk, dst);
  1579. ret = udp_queue_rcv_skb(sk, skb);
  1580. sock_put(sk);
  1581. /* a return value > 0 means to resubmit the input, but
  1582. * it wants the return to be -protocol, or 0
  1583. */
  1584. if (ret > 0)
  1585. return -ret;
  1586. return 0;
  1587. }
  1588. if (rt->rt_flags & (RTCF_BROADCAST|RTCF_MULTICAST))
  1589. return __udp4_lib_mcast_deliver(net, skb, uh,
  1590. saddr, daddr, udptable, proto);
  1591. sk = __udp4_lib_lookup_skb(skb, uh->source, uh->dest, udptable);
  1592. if (sk) {
  1593. int ret;
  1594. if (inet_get_convert_csum(sk) && uh->check && !IS_UDPLITE(sk))
  1595. skb_checksum_try_convert(skb, IPPROTO_UDP, uh->check,
  1596. inet_compute_pseudo);
  1597. ret = udp_queue_rcv_skb(sk, skb);
  1598. /* a return value > 0 means to resubmit the input, but
  1599. * it wants the return to be -protocol, or 0
  1600. */
  1601. if (ret > 0)
  1602. return -ret;
  1603. return 0;
  1604. }
  1605. if (!xfrm4_policy_check(NULL, XFRM_POLICY_IN, skb))
  1606. goto drop;
  1607. nf_reset(skb);
  1608. /* No socket. Drop packet silently, if checksum is wrong */
  1609. if (udp_lib_checksum_complete(skb))
  1610. goto csum_error;
  1611. UDP_INC_STATS_BH(net, UDP_MIB_NOPORTS, proto == IPPROTO_UDPLITE);
  1612. icmp_send(skb, ICMP_DEST_UNREACH, ICMP_PORT_UNREACH, 0);
  1613. /*
  1614. * Hmm. We got an UDP packet to a port to which we
  1615. * don't wanna listen. Ignore it.
  1616. */
  1617. kfree_skb(skb);
  1618. return 0;
  1619. short_packet:
  1620. net_dbg_ratelimited("UDP%s: short packet: From %pI4:%u %d/%d to %pI4:%u\n",
  1621. proto == IPPROTO_UDPLITE ? "Lite" : "",
  1622. &saddr, ntohs(uh->source),
  1623. ulen, skb->len,
  1624. &daddr, ntohs(uh->dest));
  1625. goto drop;
  1626. csum_error:
  1627. /*
  1628. * RFC1122: OK. Discards the bad packet silently (as far as
  1629. * the network is concerned, anyway) as per 4.1.3.4 (MUST).
  1630. */
  1631. net_dbg_ratelimited("UDP%s: bad checksum. From %pI4:%u to %pI4:%u ulen %d\n",
  1632. proto == IPPROTO_UDPLITE ? "Lite" : "",
  1633. &saddr, ntohs(uh->source), &daddr, ntohs(uh->dest),
  1634. ulen);
  1635. UDP_INC_STATS_BH(net, UDP_MIB_CSUMERRORS, proto == IPPROTO_UDPLITE);
  1636. drop:
  1637. UDP_INC_STATS_BH(net, UDP_MIB_INERRORS, proto == IPPROTO_UDPLITE);
  1638. kfree_skb(skb);
  1639. return 0;
  1640. }
  1641. /* We can only early demux multicast if there is a single matching socket.
  1642. * If more than one socket found returns NULL
  1643. */
  1644. static struct sock *__udp4_lib_mcast_demux_lookup(struct net *net,
  1645. __be16 loc_port, __be32 loc_addr,
  1646. __be16 rmt_port, __be32 rmt_addr,
  1647. int dif)
  1648. {
  1649. struct sock *sk, *result;
  1650. unsigned short hnum = ntohs(loc_port);
  1651. unsigned int slot = udp_hashfn(net, hnum, udp_table.mask);
  1652. struct udp_hslot *hslot = &udp_table.hash[slot];
  1653. /* Do not bother scanning a too big list */
  1654. if (hslot->count > 10)
  1655. return NULL;
  1656. result = NULL;
  1657. sk_for_each_rcu(sk, &hslot->head) {
  1658. if (__udp_is_mcast_sock(net, sk, loc_port, loc_addr,
  1659. rmt_port, rmt_addr, dif, hnum)) {
  1660. if (result)
  1661. return NULL;
  1662. result = sk;
  1663. }
  1664. }
  1665. return result;
  1666. }
  1667. /* For unicast we should only early demux connected sockets or we can
  1668. * break forwarding setups. The chains here can be long so only check
  1669. * if the first socket is an exact match and if not move on.
  1670. */
  1671. static struct sock *__udp4_lib_demux_lookup(struct net *net,
  1672. __be16 loc_port, __be32 loc_addr,
  1673. __be16 rmt_port, __be32 rmt_addr,
  1674. int dif)
  1675. {
  1676. unsigned short hnum = ntohs(loc_port);
  1677. unsigned int hash2 = udp4_portaddr_hash(net, loc_addr, hnum);
  1678. unsigned int slot2 = hash2 & udp_table.mask;
  1679. struct udp_hslot *hslot2 = &udp_table.hash2[slot2];
  1680. INET_ADDR_COOKIE(acookie, rmt_addr, loc_addr);
  1681. const __portpair ports = INET_COMBINED_PORTS(rmt_port, hnum);
  1682. struct sock *sk;
  1683. udp_portaddr_for_each_entry_rcu(sk, &hslot2->head) {
  1684. if (INET_MATCH(sk, net, acookie, rmt_addr,
  1685. loc_addr, ports, dif))
  1686. return sk;
  1687. /* Only check first socket in chain */
  1688. break;
  1689. }
  1690. return NULL;
  1691. }
  1692. void udp_v4_early_demux(struct sk_buff *skb)
  1693. {
  1694. struct net *net = dev_net(skb->dev);
  1695. const struct iphdr *iph;
  1696. const struct udphdr *uh;
  1697. struct sock *sk = NULL;
  1698. struct dst_entry *dst;
  1699. int dif = skb->dev->ifindex;
  1700. int ours;
  1701. /* validate the packet */
  1702. if (!pskb_may_pull(skb, skb_transport_offset(skb) + sizeof(struct udphdr)))
  1703. return;
  1704. iph = ip_hdr(skb);
  1705. uh = udp_hdr(skb);
  1706. if (skb->pkt_type == PACKET_BROADCAST ||
  1707. skb->pkt_type == PACKET_MULTICAST) {
  1708. struct in_device *in_dev = __in_dev_get_rcu(skb->dev);
  1709. if (!in_dev)
  1710. return;
  1711. /* we are supposed to accept bcast packets */
  1712. if (skb->pkt_type == PACKET_MULTICAST) {
  1713. ours = ip_check_mc_rcu(in_dev, iph->daddr, iph->saddr,
  1714. iph->protocol);
  1715. if (!ours)
  1716. return;
  1717. }
  1718. sk = __udp4_lib_mcast_demux_lookup(net, uh->dest, iph->daddr,
  1719. uh->source, iph->saddr, dif);
  1720. } else if (skb->pkt_type == PACKET_HOST) {
  1721. sk = __udp4_lib_demux_lookup(net, uh->dest, iph->daddr,
  1722. uh->source, iph->saddr, dif);
  1723. }
  1724. if (!sk || !atomic_inc_not_zero_hint(&sk->sk_refcnt, 2))
  1725. return;
  1726. skb->sk = sk;
  1727. skb->destructor = sock_efree;
  1728. dst = READ_ONCE(sk->sk_rx_dst);
  1729. if (dst)
  1730. dst = dst_check(dst, 0);
  1731. if (dst) {
  1732. /* DST_NOCACHE can not be used without taking a reference */
  1733. if (dst->flags & DST_NOCACHE) {
  1734. if (likely(atomic_inc_not_zero(&dst->__refcnt)))
  1735. skb_dst_set(skb, dst);
  1736. } else {
  1737. skb_dst_set_noref(skb, dst);
  1738. }
  1739. }
  1740. }
  1741. int udp_rcv(struct sk_buff *skb)
  1742. {
  1743. return __udp4_lib_rcv(skb, &udp_table, IPPROTO_UDP);
  1744. }
  1745. void udp_destroy_sock(struct sock *sk)
  1746. {
  1747. struct udp_sock *up = udp_sk(sk);
  1748. bool slow = lock_sock_fast(sk);
  1749. udp_flush_pending_frames(sk);
  1750. unlock_sock_fast(sk, slow);
  1751. if (static_key_false(&udp_encap_needed) && up->encap_type) {
  1752. void (*encap_destroy)(struct sock *sk);
  1753. encap_destroy = ACCESS_ONCE(up->encap_destroy);
  1754. if (encap_destroy)
  1755. encap_destroy(sk);
  1756. }
  1757. }
  1758. /*
  1759. * Socket option code for UDP
  1760. */
  1761. int udp_lib_setsockopt(struct sock *sk, int level, int optname,
  1762. char __user *optval, unsigned int optlen,
  1763. int (*push_pending_frames)(struct sock *))
  1764. {
  1765. struct udp_sock *up = udp_sk(sk);
  1766. int val, valbool;
  1767. int err = 0;
  1768. int is_udplite = IS_UDPLITE(sk);
  1769. if (optlen < sizeof(int))
  1770. return -EINVAL;
  1771. if (get_user(val, (int __user *)optval))
  1772. return -EFAULT;
  1773. valbool = val ? 1 : 0;
  1774. switch (optname) {
  1775. case UDP_CORK:
  1776. if (val != 0) {
  1777. up->corkflag = 1;
  1778. } else {
  1779. up->corkflag = 0;
  1780. lock_sock(sk);
  1781. push_pending_frames(sk);
  1782. release_sock(sk);
  1783. }
  1784. break;
  1785. case UDP_ENCAP:
  1786. switch (val) {
  1787. case 0:
  1788. case UDP_ENCAP_ESPINUDP:
  1789. case UDP_ENCAP_ESPINUDP_NON_IKE:
  1790. up->encap_rcv = xfrm4_udp_encap_rcv;
  1791. /* FALLTHROUGH */
  1792. case UDP_ENCAP_L2TPINUDP:
  1793. up->encap_type = val;
  1794. udp_encap_enable();
  1795. break;
  1796. default:
  1797. err = -ENOPROTOOPT;
  1798. break;
  1799. }
  1800. break;
  1801. case UDP_NO_CHECK6_TX:
  1802. up->no_check6_tx = valbool;
  1803. break;
  1804. case UDP_NO_CHECK6_RX:
  1805. up->no_check6_rx = valbool;
  1806. break;
  1807. /*
  1808. * UDP-Lite's partial checksum coverage (RFC 3828).
  1809. */
  1810. /* The sender sets actual checksum coverage length via this option.
  1811. * The case coverage > packet length is handled by send module. */
  1812. case UDPLITE_SEND_CSCOV:
  1813. if (!is_udplite) /* Disable the option on UDP sockets */
  1814. return -ENOPROTOOPT;
  1815. if (val != 0 && val < 8) /* Illegal coverage: use default (8) */
  1816. val = 8;
  1817. else if (val > USHRT_MAX)
  1818. val = USHRT_MAX;
  1819. up->pcslen = val;
  1820. up->pcflag |= UDPLITE_SEND_CC;
  1821. break;
  1822. /* The receiver specifies a minimum checksum coverage value. To make
  1823. * sense, this should be set to at least 8 (as done below). If zero is
  1824. * used, this again means full checksum coverage. */
  1825. case UDPLITE_RECV_CSCOV:
  1826. if (!is_udplite) /* Disable the option on UDP sockets */
  1827. return -ENOPROTOOPT;
  1828. if (val != 0 && val < 8) /* Avoid silly minimal values. */
  1829. val = 8;
  1830. else if (val > USHRT_MAX)
  1831. val = USHRT_MAX;
  1832. up->pcrlen = val;
  1833. up->pcflag |= UDPLITE_RECV_CC;
  1834. break;
  1835. default:
  1836. err = -ENOPROTOOPT;
  1837. break;
  1838. }
  1839. return err;
  1840. }
  1841. EXPORT_SYMBOL(udp_lib_setsockopt);
  1842. int udp_setsockopt(struct sock *sk, int level, int optname,
  1843. char __user *optval, unsigned int optlen)
  1844. {
  1845. if (level == SOL_UDP || level == SOL_UDPLITE)
  1846. return udp_lib_setsockopt(sk, level, optname, optval, optlen,
  1847. udp_push_pending_frames);
  1848. return ip_setsockopt(sk, level, optname, optval, optlen);
  1849. }
  1850. #ifdef CONFIG_COMPAT
  1851. int compat_udp_setsockopt(struct sock *sk, int level, int optname,
  1852. char __user *optval, unsigned int optlen)
  1853. {
  1854. if (level == SOL_UDP || level == SOL_UDPLITE)
  1855. return udp_lib_setsockopt(sk, level, optname, optval, optlen,
  1856. udp_push_pending_frames);
  1857. return compat_ip_setsockopt(sk, level, optname, optval, optlen);
  1858. }
  1859. #endif
  1860. int udp_lib_getsockopt(struct sock *sk, int level, int optname,
  1861. char __user *optval, int __user *optlen)
  1862. {
  1863. struct udp_sock *up = udp_sk(sk);
  1864. int val, len;
  1865. if (get_user(len, optlen))
  1866. return -EFAULT;
  1867. len = min_t(unsigned int, len, sizeof(int));
  1868. if (len < 0)
  1869. return -EINVAL;
  1870. switch (optname) {
  1871. case UDP_CORK:
  1872. val = up->corkflag;
  1873. break;
  1874. case UDP_ENCAP:
  1875. val = up->encap_type;
  1876. break;
  1877. case UDP_NO_CHECK6_TX:
  1878. val = up->no_check6_tx;
  1879. break;
  1880. case UDP_NO_CHECK6_RX:
  1881. val = up->no_check6_rx;
  1882. break;
  1883. /* The following two cannot be changed on UDP sockets, the return is
  1884. * always 0 (which corresponds to the full checksum coverage of UDP). */
  1885. case UDPLITE_SEND_CSCOV:
  1886. val = up->pcslen;
  1887. break;
  1888. case UDPLITE_RECV_CSCOV:
  1889. val = up->pcrlen;
  1890. break;
  1891. default:
  1892. return -ENOPROTOOPT;
  1893. }
  1894. if (put_user(len, optlen))
  1895. return -EFAULT;
  1896. if (copy_to_user(optval, &val, len))
  1897. return -EFAULT;
  1898. return 0;
  1899. }
  1900. EXPORT_SYMBOL(udp_lib_getsockopt);
  1901. int udp_getsockopt(struct sock *sk, int level, int optname,
  1902. char __user *optval, int __user *optlen)
  1903. {
  1904. if (level == SOL_UDP || level == SOL_UDPLITE)
  1905. return udp_lib_getsockopt(sk, level, optname, optval, optlen);
  1906. return ip_getsockopt(sk, level, optname, optval, optlen);
  1907. }
  1908. #ifdef CONFIG_COMPAT
  1909. int compat_udp_getsockopt(struct sock *sk, int level, int optname,
  1910. char __user *optval, int __user *optlen)
  1911. {
  1912. if (level == SOL_UDP || level == SOL_UDPLITE)
  1913. return udp_lib_getsockopt(sk, level, optname, optval, optlen);
  1914. return compat_ip_getsockopt(sk, level, optname, optval, optlen);
  1915. }
  1916. #endif
  1917. /**
  1918. * udp_poll - wait for a UDP event.
  1919. * @file - file struct
  1920. * @sock - socket
  1921. * @wait - poll table
  1922. *
  1923. * This is same as datagram poll, except for the special case of
  1924. * blocking sockets. If application is using a blocking fd
  1925. * and a packet with checksum error is in the queue;
  1926. * then it could get return from select indicating data available
  1927. * but then block when reading it. Add special case code
  1928. * to work around these arguably broken applications.
  1929. */
  1930. unsigned int udp_poll(struct file *file, struct socket *sock, poll_table *wait)
  1931. {
  1932. unsigned int mask = datagram_poll(file, sock, wait);
  1933. struct sock *sk = sock->sk;
  1934. sock_rps_record_flow(sk);
  1935. /* Check for false positives due to checksum errors */
  1936. if ((mask & POLLRDNORM) && !(file->f_flags & O_NONBLOCK) &&
  1937. !(sk->sk_shutdown & RCV_SHUTDOWN) && !first_packet_length(sk))
  1938. mask &= ~(POLLIN | POLLRDNORM);
  1939. return mask;
  1940. }
  1941. EXPORT_SYMBOL(udp_poll);
  1942. struct proto udp_prot = {
  1943. .name = "UDP",
  1944. .owner = THIS_MODULE,
  1945. .close = udp_lib_close,
  1946. .connect = ip4_datagram_connect,
  1947. .disconnect = udp_disconnect,
  1948. .ioctl = udp_ioctl,
  1949. .destroy = udp_destroy_sock,
  1950. .setsockopt = udp_setsockopt,
  1951. .getsockopt = udp_getsockopt,
  1952. .sendmsg = udp_sendmsg,
  1953. .recvmsg = udp_recvmsg,
  1954. .sendpage = udp_sendpage,
  1955. .backlog_rcv = __udp_queue_rcv_skb,
  1956. .release_cb = ip4_datagram_release_cb,
  1957. .hash = udp_lib_hash,
  1958. .unhash = udp_lib_unhash,
  1959. .rehash = udp_v4_rehash,
  1960. .get_port = udp_v4_get_port,
  1961. .memory_allocated = &udp_memory_allocated,
  1962. .sysctl_mem = sysctl_udp_mem,
  1963. .sysctl_wmem = &sysctl_udp_wmem_min,
  1964. .sysctl_rmem = &sysctl_udp_rmem_min,
  1965. .obj_size = sizeof(struct udp_sock),
  1966. .slab_flags = SLAB_DESTROY_BY_RCU,
  1967. .h.udp_table = &udp_table,
  1968. #ifdef CONFIG_COMPAT
  1969. .compat_setsockopt = compat_udp_setsockopt,
  1970. .compat_getsockopt = compat_udp_getsockopt,
  1971. #endif
  1972. .clear_sk = sk_prot_clear_portaddr_nulls,
  1973. };
  1974. EXPORT_SYMBOL(udp_prot);
  1975. /* ------------------------------------------------------------------------ */
  1976. #ifdef CONFIG_PROC_FS
  1977. static struct sock *udp_get_first(struct seq_file *seq, int start)
  1978. {
  1979. struct sock *sk;
  1980. struct udp_iter_state *state = seq->private;
  1981. struct net *net = seq_file_net(seq);
  1982. for (state->bucket = start; state->bucket <= state->udp_table->mask;
  1983. ++state->bucket) {
  1984. struct udp_hslot *hslot = &state->udp_table->hash[state->bucket];
  1985. if (hlist_empty(&hslot->head))
  1986. continue;
  1987. spin_lock_bh(&hslot->lock);
  1988. sk_for_each(sk, &hslot->head) {
  1989. if (!net_eq(sock_net(sk), net))
  1990. continue;
  1991. if (sk->sk_family == state->family)
  1992. goto found;
  1993. }
  1994. spin_unlock_bh(&hslot->lock);
  1995. }
  1996. sk = NULL;
  1997. found:
  1998. return sk;
  1999. }
  2000. static struct sock *udp_get_next(struct seq_file *seq, struct sock *sk)
  2001. {
  2002. struct udp_iter_state *state = seq->private;
  2003. struct net *net = seq_file_net(seq);
  2004. do {
  2005. sk = sk_next(sk);
  2006. } while (sk && (!net_eq(sock_net(sk), net) || sk->sk_family != state->family));
  2007. if (!sk) {
  2008. if (state->bucket <= state->udp_table->mask)
  2009. spin_unlock_bh(&state->udp_table->hash[state->bucket].lock);
  2010. return udp_get_first(seq, state->bucket + 1);
  2011. }
  2012. return sk;
  2013. }
  2014. static struct sock *udp_get_idx(struct seq_file *seq, loff_t pos)
  2015. {
  2016. struct sock *sk = udp_get_first(seq, 0);
  2017. if (sk)
  2018. while (pos && (sk = udp_get_next(seq, sk)) != NULL)
  2019. --pos;
  2020. return pos ? NULL : sk;
  2021. }
  2022. static void *udp_seq_start(struct seq_file *seq, loff_t *pos)
  2023. {
  2024. struct udp_iter_state *state = seq->private;
  2025. state->bucket = MAX_UDP_PORTS;
  2026. return *pos ? udp_get_idx(seq, *pos-1) : SEQ_START_TOKEN;
  2027. }
  2028. static void *udp_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  2029. {
  2030. struct sock *sk;
  2031. if (v == SEQ_START_TOKEN)
  2032. sk = udp_get_idx(seq, 0);
  2033. else
  2034. sk = udp_get_next(seq, v);
  2035. ++*pos;
  2036. return sk;
  2037. }
  2038. static void udp_seq_stop(struct seq_file *seq, void *v)
  2039. {
  2040. struct udp_iter_state *state = seq->private;
  2041. if (state->bucket <= state->udp_table->mask)
  2042. spin_unlock_bh(&state->udp_table->hash[state->bucket].lock);
  2043. }
  2044. int udp_seq_open(struct inode *inode, struct file *file)
  2045. {
  2046. struct udp_seq_afinfo *afinfo = PDE_DATA(inode);
  2047. struct udp_iter_state *s;
  2048. int err;
  2049. err = seq_open_net(inode, file, &afinfo->seq_ops,
  2050. sizeof(struct udp_iter_state));
  2051. if (err < 0)
  2052. return err;
  2053. s = ((struct seq_file *)file->private_data)->private;
  2054. s->family = afinfo->family;
  2055. s->udp_table = afinfo->udp_table;
  2056. return err;
  2057. }
  2058. EXPORT_SYMBOL(udp_seq_open);
  2059. /* ------------------------------------------------------------------------ */
  2060. int udp_proc_register(struct net *net, struct udp_seq_afinfo *afinfo)
  2061. {
  2062. struct proc_dir_entry *p;
  2063. int rc = 0;
  2064. afinfo->seq_ops.start = udp_seq_start;
  2065. afinfo->seq_ops.next = udp_seq_next;
  2066. afinfo->seq_ops.stop = udp_seq_stop;
  2067. p = proc_create_data(afinfo->name, S_IRUGO, net->proc_net,
  2068. afinfo->seq_fops, afinfo);
  2069. if (!p)
  2070. rc = -ENOMEM;
  2071. return rc;
  2072. }
  2073. EXPORT_SYMBOL(udp_proc_register);
  2074. void udp_proc_unregister(struct net *net, struct udp_seq_afinfo *afinfo)
  2075. {
  2076. remove_proc_entry(afinfo->name, net->proc_net);
  2077. }
  2078. EXPORT_SYMBOL(udp_proc_unregister);
  2079. /* ------------------------------------------------------------------------ */
  2080. static void udp4_format_sock(struct sock *sp, struct seq_file *f,
  2081. int bucket)
  2082. {
  2083. struct inet_sock *inet = inet_sk(sp);
  2084. __be32 dest = inet->inet_daddr;
  2085. __be32 src = inet->inet_rcv_saddr;
  2086. __u16 destp = ntohs(inet->inet_dport);
  2087. __u16 srcp = ntohs(inet->inet_sport);
  2088. seq_printf(f, "%5d: %08X:%04X %08X:%04X"
  2089. " %02X %08X:%08X %02X:%08lX %08X %5u %8d %lu %d %pK %d",
  2090. bucket, src, srcp, dest, destp, sp->sk_state,
  2091. sk_wmem_alloc_get(sp),
  2092. sk_rmem_alloc_get(sp),
  2093. 0, 0L, 0,
  2094. from_kuid_munged(seq_user_ns(f), sock_i_uid(sp)),
  2095. 0, sock_i_ino(sp),
  2096. atomic_read(&sp->sk_refcnt), sp,
  2097. atomic_read(&sp->sk_drops));
  2098. }
  2099. int udp4_seq_show(struct seq_file *seq, void *v)
  2100. {
  2101. seq_setwidth(seq, 127);
  2102. if (v == SEQ_START_TOKEN)
  2103. seq_puts(seq, " sl local_address rem_address st tx_queue "
  2104. "rx_queue tr tm->when retrnsmt uid timeout "
  2105. "inode ref pointer drops");
  2106. else {
  2107. struct udp_iter_state *state = seq->private;
  2108. udp4_format_sock(v, seq, state->bucket);
  2109. }
  2110. seq_pad(seq, '\n');
  2111. return 0;
  2112. }
  2113. static const struct file_operations udp_afinfo_seq_fops = {
  2114. .owner = THIS_MODULE,
  2115. .open = udp_seq_open,
  2116. .read = seq_read,
  2117. .llseek = seq_lseek,
  2118. .release = seq_release_net
  2119. };
  2120. /* ------------------------------------------------------------------------ */
  2121. static struct udp_seq_afinfo udp4_seq_afinfo = {
  2122. .name = "udp",
  2123. .family = AF_INET,
  2124. .udp_table = &udp_table,
  2125. .seq_fops = &udp_afinfo_seq_fops,
  2126. .seq_ops = {
  2127. .show = udp4_seq_show,
  2128. },
  2129. };
  2130. static int __net_init udp4_proc_init_net(struct net *net)
  2131. {
  2132. return udp_proc_register(net, &udp4_seq_afinfo);
  2133. }
  2134. static void __net_exit udp4_proc_exit_net(struct net *net)
  2135. {
  2136. udp_proc_unregister(net, &udp4_seq_afinfo);
  2137. }
  2138. static struct pernet_operations udp4_net_ops = {
  2139. .init = udp4_proc_init_net,
  2140. .exit = udp4_proc_exit_net,
  2141. };
  2142. int __init udp4_proc_init(void)
  2143. {
  2144. return register_pernet_subsys(&udp4_net_ops);
  2145. }
  2146. void udp4_proc_exit(void)
  2147. {
  2148. unregister_pernet_subsys(&udp4_net_ops);
  2149. }
  2150. #endif /* CONFIG_PROC_FS */
  2151. static __initdata unsigned long uhash_entries;
  2152. static int __init set_uhash_entries(char *str)
  2153. {
  2154. ssize_t ret;
  2155. if (!str)
  2156. return 0;
  2157. ret = kstrtoul(str, 0, &uhash_entries);
  2158. if (ret)
  2159. return 0;
  2160. if (uhash_entries && uhash_entries < UDP_HTABLE_SIZE_MIN)
  2161. uhash_entries = UDP_HTABLE_SIZE_MIN;
  2162. return 1;
  2163. }
  2164. __setup("uhash_entries=", set_uhash_entries);
  2165. void __init udp_table_init(struct udp_table *table, const char *name)
  2166. {
  2167. unsigned int i;
  2168. table->hash = alloc_large_system_hash(name,
  2169. 2 * sizeof(struct udp_hslot),
  2170. uhash_entries,
  2171. 21, /* one slot per 2 MB */
  2172. 0,
  2173. &table->log,
  2174. &table->mask,
  2175. UDP_HTABLE_SIZE_MIN,
  2176. 64 * 1024);
  2177. table->hash2 = table->hash + (table->mask + 1);
  2178. for (i = 0; i <= table->mask; i++) {
  2179. INIT_HLIST_HEAD(&table->hash[i].head);
  2180. table->hash[i].count = 0;
  2181. spin_lock_init(&table->hash[i].lock);
  2182. }
  2183. for (i = 0; i <= table->mask; i++) {
  2184. INIT_HLIST_HEAD(&table->hash2[i].head);
  2185. table->hash2[i].count = 0;
  2186. spin_lock_init(&table->hash2[i].lock);
  2187. }
  2188. }
  2189. u32 udp_flow_hashrnd(void)
  2190. {
  2191. static u32 hashrnd __read_mostly;
  2192. net_get_random_once(&hashrnd, sizeof(hashrnd));
  2193. return hashrnd;
  2194. }
  2195. EXPORT_SYMBOL(udp_flow_hashrnd);
  2196. void __init udp_init(void)
  2197. {
  2198. unsigned long limit;
  2199. udp_table_init(&udp_table, "UDP");
  2200. limit = nr_free_buffer_pages() / 8;
  2201. limit = max(limit, 128UL);
  2202. sysctl_udp_mem[0] = limit / 4 * 3;
  2203. sysctl_udp_mem[1] = limit;
  2204. sysctl_udp_mem[2] = sysctl_udp_mem[0] * 2;
  2205. sysctl_udp_rmem_min = SK_MEM_QUANTUM;
  2206. sysctl_udp_wmem_min = SK_MEM_QUANTUM;
  2207. }