tcp.c 82 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190
  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. * Implementation of the Transmission Control Protocol(TCP).
  7. *
  8. * Authors: Ross Biro
  9. * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
  10. * Mark Evans, <evansmp@uhura.aston.ac.uk>
  11. * Corey Minyard <wf-rch!minyard@relay.EU.net>
  12. * Florian La Roche, <flla@stud.uni-sb.de>
  13. * Charles Hedrick, <hedrick@klinzhai.rutgers.edu>
  14. * Linus Torvalds, <torvalds@cs.helsinki.fi>
  15. * Alan Cox, <gw4pts@gw4pts.ampr.org>
  16. * Matthew Dillon, <dillon@apollo.west.oic.com>
  17. * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
  18. * Jorge Cwik, <jorge@laser.satlink.net>
  19. *
  20. * Fixes:
  21. * Alan Cox : Numerous verify_area() calls
  22. * Alan Cox : Set the ACK bit on a reset
  23. * Alan Cox : Stopped it crashing if it closed while
  24. * sk->inuse=1 and was trying to connect
  25. * (tcp_err()).
  26. * Alan Cox : All icmp error handling was broken
  27. * pointers passed where wrong and the
  28. * socket was looked up backwards. Nobody
  29. * tested any icmp error code obviously.
  30. * Alan Cox : tcp_err() now handled properly. It
  31. * wakes people on errors. poll
  32. * behaves and the icmp error race
  33. * has gone by moving it into sock.c
  34. * Alan Cox : tcp_send_reset() fixed to work for
  35. * everything not just packets for
  36. * unknown sockets.
  37. * Alan Cox : tcp option processing.
  38. * Alan Cox : Reset tweaked (still not 100%) [Had
  39. * syn rule wrong]
  40. * Herp Rosmanith : More reset fixes
  41. * Alan Cox : No longer acks invalid rst frames.
  42. * Acking any kind of RST is right out.
  43. * Alan Cox : Sets an ignore me flag on an rst
  44. * receive otherwise odd bits of prattle
  45. * escape still
  46. * Alan Cox : Fixed another acking RST frame bug.
  47. * Should stop LAN workplace lockups.
  48. * Alan Cox : Some tidyups using the new skb list
  49. * facilities
  50. * Alan Cox : sk->keepopen now seems to work
  51. * Alan Cox : Pulls options out correctly on accepts
  52. * Alan Cox : Fixed assorted sk->rqueue->next errors
  53. * Alan Cox : PSH doesn't end a TCP read. Switched a
  54. * bit to skb ops.
  55. * Alan Cox : Tidied tcp_data to avoid a potential
  56. * nasty.
  57. * Alan Cox : Added some better commenting, as the
  58. * tcp is hard to follow
  59. * Alan Cox : Removed incorrect check for 20 * psh
  60. * Michael O'Reilly : ack < copied bug fix.
  61. * Johannes Stille : Misc tcp fixes (not all in yet).
  62. * Alan Cox : FIN with no memory -> CRASH
  63. * Alan Cox : Added socket option proto entries.
  64. * Also added awareness of them to accept.
  65. * Alan Cox : Added TCP options (SOL_TCP)
  66. * Alan Cox : Switched wakeup calls to callbacks,
  67. * so the kernel can layer network
  68. * sockets.
  69. * Alan Cox : Use ip_tos/ip_ttl settings.
  70. * Alan Cox : Handle FIN (more) properly (we hope).
  71. * Alan Cox : RST frames sent on unsynchronised
  72. * state ack error.
  73. * Alan Cox : Put in missing check for SYN bit.
  74. * Alan Cox : Added tcp_select_window() aka NET2E
  75. * window non shrink trick.
  76. * Alan Cox : Added a couple of small NET2E timer
  77. * fixes
  78. * Charles Hedrick : TCP fixes
  79. * Toomas Tamm : TCP window fixes
  80. * Alan Cox : Small URG fix to rlogin ^C ack fight
  81. * Charles Hedrick : Rewrote most of it to actually work
  82. * Linus : Rewrote tcp_read() and URG handling
  83. * completely
  84. * Gerhard Koerting: Fixed some missing timer handling
  85. * Matthew Dillon : Reworked TCP machine states as per RFC
  86. * Gerhard Koerting: PC/TCP workarounds
  87. * Adam Caldwell : Assorted timer/timing errors
  88. * Matthew Dillon : Fixed another RST bug
  89. * Alan Cox : Move to kernel side addressing changes.
  90. * Alan Cox : Beginning work on TCP fastpathing
  91. * (not yet usable)
  92. * Arnt Gulbrandsen: Turbocharged tcp_check() routine.
  93. * Alan Cox : TCP fast path debugging
  94. * Alan Cox : Window clamping
  95. * Michael Riepe : Bug in tcp_check()
  96. * Matt Dillon : More TCP improvements and RST bug fixes
  97. * Matt Dillon : Yet more small nasties remove from the
  98. * TCP code (Be very nice to this man if
  99. * tcp finally works 100%) 8)
  100. * Alan Cox : BSD accept semantics.
  101. * Alan Cox : Reset on closedown bug.
  102. * Peter De Schrijver : ENOTCONN check missing in tcp_sendto().
  103. * Michael Pall : Handle poll() after URG properly in
  104. * all cases.
  105. * Michael Pall : Undo the last fix in tcp_read_urg()
  106. * (multi URG PUSH broke rlogin).
  107. * Michael Pall : Fix the multi URG PUSH problem in
  108. * tcp_readable(), poll() after URG
  109. * works now.
  110. * Michael Pall : recv(...,MSG_OOB) never blocks in the
  111. * BSD api.
  112. * Alan Cox : Changed the semantics of sk->socket to
  113. * fix a race and a signal problem with
  114. * accept() and async I/O.
  115. * Alan Cox : Relaxed the rules on tcp_sendto().
  116. * Yury Shevchuk : Really fixed accept() blocking problem.
  117. * Craig I. Hagan : Allow for BSD compatible TIME_WAIT for
  118. * clients/servers which listen in on
  119. * fixed ports.
  120. * Alan Cox : Cleaned the above up and shrank it to
  121. * a sensible code size.
  122. * Alan Cox : Self connect lockup fix.
  123. * Alan Cox : No connect to multicast.
  124. * Ross Biro : Close unaccepted children on master
  125. * socket close.
  126. * Alan Cox : Reset tracing code.
  127. * Alan Cox : Spurious resets on shutdown.
  128. * Alan Cox : Giant 15 minute/60 second timer error
  129. * Alan Cox : Small whoops in polling before an
  130. * accept.
  131. * Alan Cox : Kept the state trace facility since
  132. * it's handy for debugging.
  133. * Alan Cox : More reset handler fixes.
  134. * Alan Cox : Started rewriting the code based on
  135. * the RFC's for other useful protocol
  136. * references see: Comer, KA9Q NOS, and
  137. * for a reference on the difference
  138. * between specifications and how BSD
  139. * works see the 4.4lite source.
  140. * A.N.Kuznetsov : Don't time wait on completion of tidy
  141. * close.
  142. * Linus Torvalds : Fin/Shutdown & copied_seq changes.
  143. * Linus Torvalds : Fixed BSD port reuse to work first syn
  144. * Alan Cox : Reimplemented timers as per the RFC
  145. * and using multiple timers for sanity.
  146. * Alan Cox : Small bug fixes, and a lot of new
  147. * comments.
  148. * Alan Cox : Fixed dual reader crash by locking
  149. * the buffers (much like datagram.c)
  150. * Alan Cox : Fixed stuck sockets in probe. A probe
  151. * now gets fed up of retrying without
  152. * (even a no space) answer.
  153. * Alan Cox : Extracted closing code better
  154. * Alan Cox : Fixed the closing state machine to
  155. * resemble the RFC.
  156. * Alan Cox : More 'per spec' fixes.
  157. * Jorge Cwik : Even faster checksumming.
  158. * Alan Cox : tcp_data() doesn't ack illegal PSH
  159. * only frames. At least one pc tcp stack
  160. * generates them.
  161. * Alan Cox : Cache last socket.
  162. * Alan Cox : Per route irtt.
  163. * Matt Day : poll()->select() match BSD precisely on error
  164. * Alan Cox : New buffers
  165. * Marc Tamsky : Various sk->prot->retransmits and
  166. * sk->retransmits misupdating fixed.
  167. * Fixed tcp_write_timeout: stuck close,
  168. * and TCP syn retries gets used now.
  169. * Mark Yarvis : In tcp_read_wakeup(), don't send an
  170. * ack if state is TCP_CLOSED.
  171. * Alan Cox : Look up device on a retransmit - routes may
  172. * change. Doesn't yet cope with MSS shrink right
  173. * but it's a start!
  174. * Marc Tamsky : Closing in closing fixes.
  175. * Mike Shaver : RFC1122 verifications.
  176. * Alan Cox : rcv_saddr errors.
  177. * Alan Cox : Block double connect().
  178. * Alan Cox : Small hooks for enSKIP.
  179. * Alexey Kuznetsov: Path MTU discovery.
  180. * Alan Cox : Support soft errors.
  181. * Alan Cox : Fix MTU discovery pathological case
  182. * when the remote claims no mtu!
  183. * Marc Tamsky : TCP_CLOSE fix.
  184. * Colin (G3TNE) : Send a reset on syn ack replies in
  185. * window but wrong (fixes NT lpd problems)
  186. * Pedro Roque : Better TCP window handling, delayed ack.
  187. * Joerg Reuter : No modification of locked buffers in
  188. * tcp_do_retransmit()
  189. * Eric Schenk : Changed receiver side silly window
  190. * avoidance algorithm to BSD style
  191. * algorithm. This doubles throughput
  192. * against machines running Solaris,
  193. * and seems to result in general
  194. * improvement.
  195. * Stefan Magdalinski : adjusted tcp_readable() to fix FIONREAD
  196. * Willy Konynenberg : Transparent proxying support.
  197. * Mike McLagan : Routing by source
  198. * Keith Owens : Do proper merging with partial SKB's in
  199. * tcp_do_sendmsg to avoid burstiness.
  200. * Eric Schenk : Fix fast close down bug with
  201. * shutdown() followed by close().
  202. * Andi Kleen : Make poll agree with SIGIO
  203. * Salvatore Sanfilippo : Support SO_LINGER with linger == 1 and
  204. * lingertime == 0 (RFC 793 ABORT Call)
  205. * Hirokazu Takahashi : Use copy_from_user() instead of
  206. * csum_and_copy_from_user() if possible.
  207. *
  208. * This program is free software; you can redistribute it and/or
  209. * modify it under the terms of the GNU General Public License
  210. * as published by the Free Software Foundation; either version
  211. * 2 of the License, or(at your option) any later version.
  212. *
  213. * Description of States:
  214. *
  215. * TCP_SYN_SENT sent a connection request, waiting for ack
  216. *
  217. * TCP_SYN_RECV received a connection request, sent ack,
  218. * waiting for final ack in three-way handshake.
  219. *
  220. * TCP_ESTABLISHED connection established
  221. *
  222. * TCP_FIN_WAIT1 our side has shutdown, waiting to complete
  223. * transmission of remaining buffered data
  224. *
  225. * TCP_FIN_WAIT2 all buffered data sent, waiting for remote
  226. * to shutdown
  227. *
  228. * TCP_CLOSING both sides have shutdown but we still have
  229. * data we have to finish sending
  230. *
  231. * TCP_TIME_WAIT timeout to catch resent junk before entering
  232. * closed, can only be entered from FIN_WAIT2
  233. * or CLOSING. Required because the other end
  234. * may not have gotten our last ACK causing it
  235. * to retransmit the data packet (which we ignore)
  236. *
  237. * TCP_CLOSE_WAIT remote side has shutdown and is waiting for
  238. * us to finish writing our data and to shutdown
  239. * (we have to close() to move on to LAST_ACK)
  240. *
  241. * TCP_LAST_ACK out side has shutdown after remote has
  242. * shutdown. There may still be data in our
  243. * buffer that we have to finish sending
  244. *
  245. * TCP_CLOSE socket is finished
  246. */
  247. #define pr_fmt(fmt) "TCP: " fmt
  248. #include <linux/kernel.h>
  249. #include <linux/module.h>
  250. #include <linux/types.h>
  251. #include <linux/fcntl.h>
  252. #include <linux/poll.h>
  253. #include <linux/init.h>
  254. #include <linux/fs.h>
  255. #include <linux/skbuff.h>
  256. #include <linux/scatterlist.h>
  257. #include <linux/splice.h>
  258. #include <linux/net.h>
  259. #include <linux/socket.h>
  260. #include <linux/random.h>
  261. #include <linux/bootmem.h>
  262. #include <linux/highmem.h>
  263. #include <linux/swap.h>
  264. #include <linux/cache.h>
  265. #include <linux/err.h>
  266. #include <linux/crypto.h>
  267. #include <linux/time.h>
  268. #include <linux/slab.h>
  269. #include <net/icmp.h>
  270. #include <net/inet_common.h>
  271. #include <net/tcp.h>
  272. #include <net/xfrm.h>
  273. #include <net/ip.h>
  274. #include <net/netdma.h>
  275. #include <net/sock.h>
  276. #include <asm/uaccess.h>
  277. #include <asm/ioctls.h>
  278. #include <net/busy_poll.h>
  279. int sysctl_tcp_fin_timeout __read_mostly = TCP_FIN_TIMEOUT;
  280. int sysctl_tcp_min_tso_segs __read_mostly = 2;
  281. struct percpu_counter tcp_orphan_count;
  282. EXPORT_SYMBOL_GPL(tcp_orphan_count);
  283. int sysctl_tcp_wmem[3] __read_mostly;
  284. int sysctl_tcp_rmem[3] __read_mostly;
  285. EXPORT_SYMBOL(sysctl_tcp_rmem);
  286. EXPORT_SYMBOL(sysctl_tcp_wmem);
  287. atomic_long_t tcp_memory_allocated; /* Current allocated memory. */
  288. EXPORT_SYMBOL(tcp_memory_allocated);
  289. /*
  290. * Current number of TCP sockets.
  291. */
  292. struct percpu_counter tcp_sockets_allocated;
  293. EXPORT_SYMBOL(tcp_sockets_allocated);
  294. /*
  295. * TCP splice context
  296. */
  297. struct tcp_splice_state {
  298. struct pipe_inode_info *pipe;
  299. size_t len;
  300. unsigned int flags;
  301. };
  302. /*
  303. * Pressure flag: try to collapse.
  304. * Technical note: it is used by multiple contexts non atomically.
  305. * All the __sk_mem_schedule() is of this nature: accounting
  306. * is strict, actions are advisory and have some latency.
  307. */
  308. int tcp_memory_pressure __read_mostly;
  309. EXPORT_SYMBOL(tcp_memory_pressure);
  310. void tcp_enter_memory_pressure(struct sock *sk)
  311. {
  312. if (!tcp_memory_pressure) {
  313. NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPMEMORYPRESSURES);
  314. tcp_memory_pressure = 1;
  315. }
  316. }
  317. EXPORT_SYMBOL(tcp_enter_memory_pressure);
  318. /* Convert seconds to retransmits based on initial and max timeout */
  319. static u8 secs_to_retrans(int seconds, int timeout, int rto_max)
  320. {
  321. u8 res = 0;
  322. if (seconds > 0) {
  323. int period = timeout;
  324. res = 1;
  325. while (seconds > period && res < 255) {
  326. res++;
  327. timeout <<= 1;
  328. if (timeout > rto_max)
  329. timeout = rto_max;
  330. period += timeout;
  331. }
  332. }
  333. return res;
  334. }
  335. /* Convert retransmits to seconds based on initial and max timeout */
  336. static int retrans_to_secs(u8 retrans, int timeout, int rto_max)
  337. {
  338. int period = 0;
  339. if (retrans > 0) {
  340. period = timeout;
  341. while (--retrans) {
  342. timeout <<= 1;
  343. if (timeout > rto_max)
  344. timeout = rto_max;
  345. period += timeout;
  346. }
  347. }
  348. return period;
  349. }
  350. /* Address-family independent initialization for a tcp_sock.
  351. *
  352. * NOTE: A lot of things set to zero explicitly by call to
  353. * sk_alloc() so need not be done here.
  354. */
  355. void tcp_init_sock(struct sock *sk)
  356. {
  357. struct inet_connection_sock *icsk = inet_csk(sk);
  358. struct tcp_sock *tp = tcp_sk(sk);
  359. skb_queue_head_init(&tp->out_of_order_queue);
  360. tcp_init_xmit_timers(sk);
  361. tcp_prequeue_init(tp);
  362. INIT_LIST_HEAD(&tp->tsq_node);
  363. icsk->icsk_rto = TCP_TIMEOUT_INIT;
  364. tp->mdev = TCP_TIMEOUT_INIT;
  365. /* So many TCP implementations out there (incorrectly) count the
  366. * initial SYN frame in their delayed-ACK and congestion control
  367. * algorithms that we must have the following bandaid to talk
  368. * efficiently to them. -DaveM
  369. */
  370. tp->snd_cwnd = TCP_INIT_CWND;
  371. /* See draft-stevens-tcpca-spec-01 for discussion of the
  372. * initialization of these values.
  373. */
  374. tp->snd_ssthresh = TCP_INFINITE_SSTHRESH;
  375. tp->snd_cwnd_clamp = ~0;
  376. tp->mss_cache = TCP_MSS_DEFAULT;
  377. tp->reordering = sysctl_tcp_reordering;
  378. tcp_enable_early_retrans(tp);
  379. icsk->icsk_ca_ops = &tcp_init_congestion_ops;
  380. tp->tsoffset = 0;
  381. sk->sk_state = TCP_CLOSE;
  382. sk->sk_write_space = sk_stream_write_space;
  383. sock_set_flag(sk, SOCK_USE_WRITE_QUEUE);
  384. icsk->icsk_sync_mss = tcp_sync_mss;
  385. sk->sk_sndbuf = sysctl_tcp_wmem[1];
  386. sk->sk_rcvbuf = sysctl_tcp_rmem[1];
  387. local_bh_disable();
  388. sock_update_memcg(sk);
  389. sk_sockets_allocated_inc(sk);
  390. local_bh_enable();
  391. }
  392. EXPORT_SYMBOL(tcp_init_sock);
  393. /*
  394. * Wait for a TCP event.
  395. *
  396. * Note that we don't need to lock the socket, as the upper poll layers
  397. * take care of normal races (between the test and the event) and we don't
  398. * go look at any of the socket buffers directly.
  399. */
  400. unsigned int tcp_poll(struct file *file, struct socket *sock, poll_table *wait)
  401. {
  402. unsigned int mask;
  403. struct sock *sk = sock->sk;
  404. const struct tcp_sock *tp = tcp_sk(sk);
  405. sock_rps_record_flow(sk);
  406. sock_poll_wait(file, sk_sleep(sk), wait);
  407. if (sk->sk_state == TCP_LISTEN)
  408. return inet_csk_listen_poll(sk);
  409. /* Socket is not locked. We are protected from async events
  410. * by poll logic and correct handling of state changes
  411. * made by other threads is impossible in any case.
  412. */
  413. mask = 0;
  414. /*
  415. * POLLHUP is certainly not done right. But poll() doesn't
  416. * have a notion of HUP in just one direction, and for a
  417. * socket the read side is more interesting.
  418. *
  419. * Some poll() documentation says that POLLHUP is incompatible
  420. * with the POLLOUT/POLLWR flags, so somebody should check this
  421. * all. But careful, it tends to be safer to return too many
  422. * bits than too few, and you can easily break real applications
  423. * if you don't tell them that something has hung up!
  424. *
  425. * Check-me.
  426. *
  427. * Check number 1. POLLHUP is _UNMASKABLE_ event (see UNIX98 and
  428. * our fs/select.c). It means that after we received EOF,
  429. * poll always returns immediately, making impossible poll() on write()
  430. * in state CLOSE_WAIT. One solution is evident --- to set POLLHUP
  431. * if and only if shutdown has been made in both directions.
  432. * Actually, it is interesting to look how Solaris and DUX
  433. * solve this dilemma. I would prefer, if POLLHUP were maskable,
  434. * then we could set it on SND_SHUTDOWN. BTW examples given
  435. * in Stevens' books assume exactly this behaviour, it explains
  436. * why POLLHUP is incompatible with POLLOUT. --ANK
  437. *
  438. * NOTE. Check for TCP_CLOSE is added. The goal is to prevent
  439. * blocking on fresh not-connected or disconnected socket. --ANK
  440. */
  441. if (sk->sk_shutdown == SHUTDOWN_MASK || sk->sk_state == TCP_CLOSE)
  442. mask |= POLLHUP;
  443. if (sk->sk_shutdown & RCV_SHUTDOWN)
  444. mask |= POLLIN | POLLRDNORM | POLLRDHUP;
  445. /* Connected or passive Fast Open socket? */
  446. if (sk->sk_state != TCP_SYN_SENT &&
  447. (sk->sk_state != TCP_SYN_RECV || tp->fastopen_rsk != NULL)) {
  448. int target = sock_rcvlowat(sk, 0, INT_MAX);
  449. if (tp->urg_seq == tp->copied_seq &&
  450. !sock_flag(sk, SOCK_URGINLINE) &&
  451. tp->urg_data)
  452. target++;
  453. /* Potential race condition. If read of tp below will
  454. * escape above sk->sk_state, we can be illegally awaken
  455. * in SYN_* states. */
  456. if (tp->rcv_nxt - tp->copied_seq >= target)
  457. mask |= POLLIN | POLLRDNORM;
  458. if (!(sk->sk_shutdown & SEND_SHUTDOWN)) {
  459. if (sk_stream_is_writeable(sk)) {
  460. mask |= POLLOUT | POLLWRNORM;
  461. } else { /* send SIGIO later */
  462. set_bit(SOCK_ASYNC_NOSPACE,
  463. &sk->sk_socket->flags);
  464. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  465. /* Race breaker. If space is freed after
  466. * wspace test but before the flags are set,
  467. * IO signal will be lost.
  468. */
  469. if (sk_stream_is_writeable(sk))
  470. mask |= POLLOUT | POLLWRNORM;
  471. }
  472. } else
  473. mask |= POLLOUT | POLLWRNORM;
  474. if (tp->urg_data & TCP_URG_VALID)
  475. mask |= POLLPRI;
  476. }
  477. /* This barrier is coupled with smp_wmb() in tcp_reset() */
  478. smp_rmb();
  479. if (sk->sk_err)
  480. mask |= POLLERR;
  481. return mask;
  482. }
  483. EXPORT_SYMBOL(tcp_poll);
  484. int tcp_ioctl(struct sock *sk, int cmd, unsigned long arg)
  485. {
  486. struct tcp_sock *tp = tcp_sk(sk);
  487. int answ;
  488. bool slow;
  489. switch (cmd) {
  490. case SIOCINQ:
  491. if (sk->sk_state == TCP_LISTEN)
  492. return -EINVAL;
  493. slow = lock_sock_fast(sk);
  494. if ((1 << sk->sk_state) & (TCPF_SYN_SENT | TCPF_SYN_RECV))
  495. answ = 0;
  496. else if (sock_flag(sk, SOCK_URGINLINE) ||
  497. !tp->urg_data ||
  498. before(tp->urg_seq, tp->copied_seq) ||
  499. !before(tp->urg_seq, tp->rcv_nxt)) {
  500. answ = tp->rcv_nxt - tp->copied_seq;
  501. /* Subtract 1, if FIN was received */
  502. if (answ && sock_flag(sk, SOCK_DONE))
  503. answ--;
  504. } else
  505. answ = tp->urg_seq - tp->copied_seq;
  506. unlock_sock_fast(sk, slow);
  507. break;
  508. case SIOCATMARK:
  509. answ = tp->urg_data && tp->urg_seq == tp->copied_seq;
  510. break;
  511. case SIOCOUTQ:
  512. if (sk->sk_state == TCP_LISTEN)
  513. return -EINVAL;
  514. if ((1 << sk->sk_state) & (TCPF_SYN_SENT | TCPF_SYN_RECV))
  515. answ = 0;
  516. else
  517. answ = tp->write_seq - tp->snd_una;
  518. break;
  519. case SIOCOUTQNSD:
  520. if (sk->sk_state == TCP_LISTEN)
  521. return -EINVAL;
  522. if ((1 << sk->sk_state) & (TCPF_SYN_SENT | TCPF_SYN_RECV))
  523. answ = 0;
  524. else
  525. answ = tp->write_seq - tp->snd_nxt;
  526. break;
  527. default:
  528. return -ENOIOCTLCMD;
  529. }
  530. return put_user(answ, (int __user *)arg);
  531. }
  532. EXPORT_SYMBOL(tcp_ioctl);
  533. static inline void tcp_mark_push(struct tcp_sock *tp, struct sk_buff *skb)
  534. {
  535. TCP_SKB_CB(skb)->tcp_flags |= TCPHDR_PSH;
  536. tp->pushed_seq = tp->write_seq;
  537. }
  538. static inline bool forced_push(const struct tcp_sock *tp)
  539. {
  540. return after(tp->write_seq, tp->pushed_seq + (tp->max_window >> 1));
  541. }
  542. static inline void skb_entail(struct sock *sk, struct sk_buff *skb)
  543. {
  544. struct tcp_sock *tp = tcp_sk(sk);
  545. struct tcp_skb_cb *tcb = TCP_SKB_CB(skb);
  546. skb->csum = 0;
  547. tcb->seq = tcb->end_seq = tp->write_seq;
  548. tcb->tcp_flags = TCPHDR_ACK;
  549. tcb->sacked = 0;
  550. skb_header_release(skb);
  551. tcp_add_write_queue_tail(sk, skb);
  552. sk->sk_wmem_queued += skb->truesize;
  553. sk_mem_charge(sk, skb->truesize);
  554. if (tp->nonagle & TCP_NAGLE_PUSH)
  555. tp->nonagle &= ~TCP_NAGLE_PUSH;
  556. }
  557. static inline void tcp_mark_urg(struct tcp_sock *tp, int flags)
  558. {
  559. if (flags & MSG_OOB)
  560. tp->snd_up = tp->write_seq;
  561. }
  562. static inline void tcp_push(struct sock *sk, int flags, int mss_now,
  563. int nonagle)
  564. {
  565. if (tcp_send_head(sk)) {
  566. struct tcp_sock *tp = tcp_sk(sk);
  567. if (!(flags & MSG_MORE) || forced_push(tp))
  568. tcp_mark_push(tp, tcp_write_queue_tail(sk));
  569. tcp_mark_urg(tp, flags);
  570. __tcp_push_pending_frames(sk, mss_now,
  571. (flags & MSG_MORE) ? TCP_NAGLE_CORK : nonagle);
  572. }
  573. }
  574. static int tcp_splice_data_recv(read_descriptor_t *rd_desc, struct sk_buff *skb,
  575. unsigned int offset, size_t len)
  576. {
  577. struct tcp_splice_state *tss = rd_desc->arg.data;
  578. int ret;
  579. ret = skb_splice_bits(skb, offset, tss->pipe, min(rd_desc->count, len),
  580. tss->flags);
  581. if (ret > 0)
  582. rd_desc->count -= ret;
  583. return ret;
  584. }
  585. static int __tcp_splice_read(struct sock *sk, struct tcp_splice_state *tss)
  586. {
  587. /* Store TCP splice context information in read_descriptor_t. */
  588. read_descriptor_t rd_desc = {
  589. .arg.data = tss,
  590. .count = tss->len,
  591. };
  592. return tcp_read_sock(sk, &rd_desc, tcp_splice_data_recv);
  593. }
  594. /**
  595. * tcp_splice_read - splice data from TCP socket to a pipe
  596. * @sock: socket to splice from
  597. * @ppos: position (not valid)
  598. * @pipe: pipe to splice to
  599. * @len: number of bytes to splice
  600. * @flags: splice modifier flags
  601. *
  602. * Description:
  603. * Will read pages from given socket and fill them into a pipe.
  604. *
  605. **/
  606. ssize_t tcp_splice_read(struct socket *sock, loff_t *ppos,
  607. struct pipe_inode_info *pipe, size_t len,
  608. unsigned int flags)
  609. {
  610. struct sock *sk = sock->sk;
  611. struct tcp_splice_state tss = {
  612. .pipe = pipe,
  613. .len = len,
  614. .flags = flags,
  615. };
  616. long timeo;
  617. ssize_t spliced;
  618. int ret;
  619. sock_rps_record_flow(sk);
  620. /*
  621. * We can't seek on a socket input
  622. */
  623. if (unlikely(*ppos))
  624. return -ESPIPE;
  625. ret = spliced = 0;
  626. lock_sock(sk);
  627. timeo = sock_rcvtimeo(sk, sock->file->f_flags & O_NONBLOCK);
  628. while (tss.len) {
  629. ret = __tcp_splice_read(sk, &tss);
  630. if (ret < 0)
  631. break;
  632. else if (!ret) {
  633. if (spliced)
  634. break;
  635. if (sock_flag(sk, SOCK_DONE))
  636. break;
  637. if (sk->sk_err) {
  638. ret = sock_error(sk);
  639. break;
  640. }
  641. if (sk->sk_shutdown & RCV_SHUTDOWN)
  642. break;
  643. if (sk->sk_state == TCP_CLOSE) {
  644. /*
  645. * This occurs when user tries to read
  646. * from never connected socket.
  647. */
  648. if (!sock_flag(sk, SOCK_DONE))
  649. ret = -ENOTCONN;
  650. break;
  651. }
  652. if (!timeo) {
  653. ret = -EAGAIN;
  654. break;
  655. }
  656. sk_wait_data(sk, &timeo);
  657. if (signal_pending(current)) {
  658. ret = sock_intr_errno(timeo);
  659. break;
  660. }
  661. continue;
  662. }
  663. tss.len -= ret;
  664. spliced += ret;
  665. if (!timeo)
  666. break;
  667. release_sock(sk);
  668. lock_sock(sk);
  669. if (sk->sk_err || sk->sk_state == TCP_CLOSE ||
  670. (sk->sk_shutdown & RCV_SHUTDOWN) ||
  671. signal_pending(current))
  672. break;
  673. }
  674. release_sock(sk);
  675. if (spliced)
  676. return spliced;
  677. return ret;
  678. }
  679. EXPORT_SYMBOL(tcp_splice_read);
  680. struct sk_buff *sk_stream_alloc_skb(struct sock *sk, int size, gfp_t gfp)
  681. {
  682. struct sk_buff *skb;
  683. /* The TCP header must be at least 32-bit aligned. */
  684. size = ALIGN(size, 4);
  685. skb = alloc_skb_fclone(size + sk->sk_prot->max_header, gfp);
  686. if (skb) {
  687. if (sk_wmem_schedule(sk, skb->truesize)) {
  688. skb_reserve(skb, sk->sk_prot->max_header);
  689. /*
  690. * Make sure that we have exactly size bytes
  691. * available to the caller, no more, no less.
  692. */
  693. skb->reserved_tailroom = skb->end - skb->tail - size;
  694. return skb;
  695. }
  696. __kfree_skb(skb);
  697. } else {
  698. sk->sk_prot->enter_memory_pressure(sk);
  699. sk_stream_moderate_sndbuf(sk);
  700. }
  701. return NULL;
  702. }
  703. static unsigned int tcp_xmit_size_goal(struct sock *sk, u32 mss_now,
  704. int large_allowed)
  705. {
  706. struct tcp_sock *tp = tcp_sk(sk);
  707. u32 xmit_size_goal, old_size_goal;
  708. xmit_size_goal = mss_now;
  709. if (large_allowed && sk_can_gso(sk)) {
  710. u32 gso_size, hlen;
  711. /* Maybe we should/could use sk->sk_prot->max_header here ? */
  712. hlen = inet_csk(sk)->icsk_af_ops->net_header_len +
  713. inet_csk(sk)->icsk_ext_hdr_len +
  714. tp->tcp_header_len;
  715. /* Goal is to send at least one packet per ms,
  716. * not one big TSO packet every 100 ms.
  717. * This preserves ACK clocking and is consistent
  718. * with tcp_tso_should_defer() heuristic.
  719. */
  720. gso_size = sk->sk_pacing_rate / (2 * MSEC_PER_SEC);
  721. gso_size = max_t(u32, gso_size,
  722. sysctl_tcp_min_tso_segs * mss_now);
  723. xmit_size_goal = min_t(u32, gso_size,
  724. sk->sk_gso_max_size - 1 - hlen);
  725. /* TSQ : try to have at least two segments in flight
  726. * (one in NIC TX ring, another in Qdisc)
  727. */
  728. xmit_size_goal = min_t(u32, xmit_size_goal,
  729. sysctl_tcp_limit_output_bytes >> 1);
  730. xmit_size_goal = tcp_bound_to_half_wnd(tp, xmit_size_goal);
  731. /* We try hard to avoid divides here */
  732. old_size_goal = tp->xmit_size_goal_segs * mss_now;
  733. if (likely(old_size_goal <= xmit_size_goal &&
  734. old_size_goal + mss_now > xmit_size_goal)) {
  735. xmit_size_goal = old_size_goal;
  736. } else {
  737. tp->xmit_size_goal_segs =
  738. min_t(u16, xmit_size_goal / mss_now,
  739. sk->sk_gso_max_segs);
  740. xmit_size_goal = tp->xmit_size_goal_segs * mss_now;
  741. }
  742. }
  743. return max(xmit_size_goal, mss_now);
  744. }
  745. static int tcp_send_mss(struct sock *sk, int *size_goal, int flags)
  746. {
  747. int mss_now;
  748. mss_now = tcp_current_mss(sk);
  749. *size_goal = tcp_xmit_size_goal(sk, mss_now, !(flags & MSG_OOB));
  750. return mss_now;
  751. }
  752. static ssize_t do_tcp_sendpages(struct sock *sk, struct page *page, int offset,
  753. size_t size, int flags)
  754. {
  755. struct tcp_sock *tp = tcp_sk(sk);
  756. int mss_now, size_goal;
  757. int err;
  758. ssize_t copied;
  759. long timeo = sock_sndtimeo(sk, flags & MSG_DONTWAIT);
  760. /* Wait for a connection to finish. One exception is TCP Fast Open
  761. * (passive side) where data is allowed to be sent before a connection
  762. * is fully established.
  763. */
  764. if (((1 << sk->sk_state) & ~(TCPF_ESTABLISHED | TCPF_CLOSE_WAIT)) &&
  765. !tcp_passive_fastopen(sk)) {
  766. if ((err = sk_stream_wait_connect(sk, &timeo)) != 0)
  767. goto out_err;
  768. }
  769. clear_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
  770. mss_now = tcp_send_mss(sk, &size_goal, flags);
  771. copied = 0;
  772. err = -EPIPE;
  773. if (sk->sk_err || (sk->sk_shutdown & SEND_SHUTDOWN))
  774. goto out_err;
  775. while (size > 0) {
  776. struct sk_buff *skb = tcp_write_queue_tail(sk);
  777. int copy, i;
  778. bool can_coalesce;
  779. if (!tcp_send_head(sk) || (copy = size_goal - skb->len) <= 0) {
  780. new_segment:
  781. if (!sk_stream_memory_free(sk))
  782. goto wait_for_sndbuf;
  783. skb = sk_stream_alloc_skb(sk, 0, sk->sk_allocation);
  784. if (!skb)
  785. goto wait_for_memory;
  786. skb_entail(sk, skb);
  787. copy = size_goal;
  788. }
  789. if (copy > size)
  790. copy = size;
  791. i = skb_shinfo(skb)->nr_frags;
  792. can_coalesce = skb_can_coalesce(skb, i, page, offset);
  793. if (!can_coalesce && i >= MAX_SKB_FRAGS) {
  794. tcp_mark_push(tp, skb);
  795. goto new_segment;
  796. }
  797. if (!sk_wmem_schedule(sk, copy))
  798. goto wait_for_memory;
  799. if (can_coalesce) {
  800. skb_frag_size_add(&skb_shinfo(skb)->frags[i - 1], copy);
  801. } else {
  802. get_page(page);
  803. skb_fill_page_desc(skb, i, page, offset, copy);
  804. }
  805. skb_shinfo(skb)->tx_flags |= SKBTX_SHARED_FRAG;
  806. skb->len += copy;
  807. skb->data_len += copy;
  808. skb->truesize += copy;
  809. sk->sk_wmem_queued += copy;
  810. sk_mem_charge(sk, copy);
  811. skb->ip_summed = CHECKSUM_PARTIAL;
  812. tp->write_seq += copy;
  813. TCP_SKB_CB(skb)->end_seq += copy;
  814. skb_shinfo(skb)->gso_segs = 0;
  815. if (!copied)
  816. TCP_SKB_CB(skb)->tcp_flags &= ~TCPHDR_PSH;
  817. copied += copy;
  818. offset += copy;
  819. if (!(size -= copy))
  820. goto out;
  821. if (skb->len < size_goal || (flags & MSG_OOB))
  822. continue;
  823. if (forced_push(tp)) {
  824. tcp_mark_push(tp, skb);
  825. __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_PUSH);
  826. } else if (skb == tcp_send_head(sk))
  827. tcp_push_one(sk, mss_now);
  828. continue;
  829. wait_for_sndbuf:
  830. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  831. wait_for_memory:
  832. tcp_push(sk, flags & ~MSG_MORE, mss_now, TCP_NAGLE_PUSH);
  833. if ((err = sk_stream_wait_memory(sk, &timeo)) != 0)
  834. goto do_error;
  835. mss_now = tcp_send_mss(sk, &size_goal, flags);
  836. }
  837. out:
  838. if (copied && !(flags & MSG_SENDPAGE_NOTLAST))
  839. tcp_push(sk, flags, mss_now, tp->nonagle);
  840. return copied;
  841. do_error:
  842. if (copied)
  843. goto out;
  844. out_err:
  845. return sk_stream_error(sk, flags, err);
  846. }
  847. int tcp_sendpage(struct sock *sk, struct page *page, int offset,
  848. size_t size, int flags)
  849. {
  850. ssize_t res;
  851. if (!(sk->sk_route_caps & NETIF_F_SG) ||
  852. !(sk->sk_route_caps & NETIF_F_ALL_CSUM))
  853. return sock_no_sendpage(sk->sk_socket, page, offset, size,
  854. flags);
  855. lock_sock(sk);
  856. res = do_tcp_sendpages(sk, page, offset, size, flags);
  857. release_sock(sk);
  858. return res;
  859. }
  860. EXPORT_SYMBOL(tcp_sendpage);
  861. static inline int select_size(const struct sock *sk, bool sg)
  862. {
  863. const struct tcp_sock *tp = tcp_sk(sk);
  864. int tmp = tp->mss_cache;
  865. if (sg) {
  866. if (sk_can_gso(sk)) {
  867. /* Small frames wont use a full page:
  868. * Payload will immediately follow tcp header.
  869. */
  870. tmp = SKB_WITH_OVERHEAD(2048 - MAX_TCP_HEADER);
  871. } else {
  872. int pgbreak = SKB_MAX_HEAD(MAX_TCP_HEADER);
  873. if (tmp >= pgbreak &&
  874. tmp <= pgbreak + (MAX_SKB_FRAGS - 1) * PAGE_SIZE)
  875. tmp = pgbreak;
  876. }
  877. }
  878. return tmp;
  879. }
  880. void tcp_free_fastopen_req(struct tcp_sock *tp)
  881. {
  882. if (tp->fastopen_req != NULL) {
  883. kfree(tp->fastopen_req);
  884. tp->fastopen_req = NULL;
  885. }
  886. }
  887. static int tcp_sendmsg_fastopen(struct sock *sk, struct msghdr *msg, int *size)
  888. {
  889. struct tcp_sock *tp = tcp_sk(sk);
  890. int err, flags;
  891. if (!(sysctl_tcp_fastopen & TFO_CLIENT_ENABLE))
  892. return -EOPNOTSUPP;
  893. if (tp->fastopen_req != NULL)
  894. return -EALREADY; /* Another Fast Open is in progress */
  895. tp->fastopen_req = kzalloc(sizeof(struct tcp_fastopen_request),
  896. sk->sk_allocation);
  897. if (unlikely(tp->fastopen_req == NULL))
  898. return -ENOBUFS;
  899. tp->fastopen_req->data = msg;
  900. flags = (msg->msg_flags & MSG_DONTWAIT) ? O_NONBLOCK : 0;
  901. err = __inet_stream_connect(sk->sk_socket, msg->msg_name,
  902. msg->msg_namelen, flags);
  903. *size = tp->fastopen_req->copied;
  904. tcp_free_fastopen_req(tp);
  905. return err;
  906. }
  907. int tcp_sendmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
  908. size_t size)
  909. {
  910. struct iovec *iov;
  911. struct tcp_sock *tp = tcp_sk(sk);
  912. struct sk_buff *skb;
  913. int iovlen, flags, err, copied = 0;
  914. int mss_now = 0, size_goal, copied_syn = 0, offset = 0;
  915. bool sg;
  916. long timeo;
  917. lock_sock(sk);
  918. flags = msg->msg_flags;
  919. if (flags & MSG_FASTOPEN) {
  920. err = tcp_sendmsg_fastopen(sk, msg, &copied_syn);
  921. if (err == -EINPROGRESS && copied_syn > 0)
  922. goto out;
  923. else if (err)
  924. goto out_err;
  925. offset = copied_syn;
  926. }
  927. timeo = sock_sndtimeo(sk, flags & MSG_DONTWAIT);
  928. /* Wait for a connection to finish. One exception is TCP Fast Open
  929. * (passive side) where data is allowed to be sent before a connection
  930. * is fully established.
  931. */
  932. if (((1 << sk->sk_state) & ~(TCPF_ESTABLISHED | TCPF_CLOSE_WAIT)) &&
  933. !tcp_passive_fastopen(sk)) {
  934. if ((err = sk_stream_wait_connect(sk, &timeo)) != 0)
  935. goto do_error;
  936. }
  937. if (unlikely(tp->repair)) {
  938. if (tp->repair_queue == TCP_RECV_QUEUE) {
  939. copied = tcp_send_rcvq(sk, msg, size);
  940. goto out;
  941. }
  942. err = -EINVAL;
  943. if (tp->repair_queue == TCP_NO_QUEUE)
  944. goto out_err;
  945. /* 'common' sending to sendq */
  946. }
  947. /* This should be in poll */
  948. clear_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
  949. mss_now = tcp_send_mss(sk, &size_goal, flags);
  950. /* Ok commence sending. */
  951. iovlen = msg->msg_iovlen;
  952. iov = msg->msg_iov;
  953. copied = 0;
  954. err = -EPIPE;
  955. if (sk->sk_err || (sk->sk_shutdown & SEND_SHUTDOWN))
  956. goto out_err;
  957. sg = !!(sk->sk_route_caps & NETIF_F_SG);
  958. while (--iovlen >= 0) {
  959. size_t seglen = iov->iov_len;
  960. unsigned char __user *from = iov->iov_base;
  961. iov++;
  962. if (unlikely(offset > 0)) { /* Skip bytes copied in SYN */
  963. if (offset >= seglen) {
  964. offset -= seglen;
  965. continue;
  966. }
  967. seglen -= offset;
  968. from += offset;
  969. offset = 0;
  970. }
  971. while (seglen > 0) {
  972. int copy = 0;
  973. int max = size_goal;
  974. skb = tcp_write_queue_tail(sk);
  975. if (tcp_send_head(sk)) {
  976. if (skb->ip_summed == CHECKSUM_NONE)
  977. max = mss_now;
  978. copy = max - skb->len;
  979. }
  980. if (copy <= 0) {
  981. new_segment:
  982. /* Allocate new segment. If the interface is SG,
  983. * allocate skb fitting to single page.
  984. */
  985. if (!sk_stream_memory_free(sk))
  986. goto wait_for_sndbuf;
  987. skb = sk_stream_alloc_skb(sk,
  988. select_size(sk, sg),
  989. sk->sk_allocation);
  990. if (!skb)
  991. goto wait_for_memory;
  992. /*
  993. * All packets are restored as if they have
  994. * already been sent.
  995. */
  996. if (tp->repair)
  997. TCP_SKB_CB(skb)->when = tcp_time_stamp;
  998. /*
  999. * Check whether we can use HW checksum.
  1000. */
  1001. if (sk->sk_route_caps & NETIF_F_ALL_CSUM)
  1002. skb->ip_summed = CHECKSUM_PARTIAL;
  1003. skb_entail(sk, skb);
  1004. copy = size_goal;
  1005. max = size_goal;
  1006. }
  1007. /* Try to append data to the end of skb. */
  1008. if (copy > seglen)
  1009. copy = seglen;
  1010. /* Where to copy to? */
  1011. if (skb_availroom(skb) > 0) {
  1012. /* We have some space in skb head. Superb! */
  1013. copy = min_t(int, copy, skb_availroom(skb));
  1014. err = skb_add_data_nocache(sk, skb, from, copy);
  1015. if (err)
  1016. goto do_fault;
  1017. } else {
  1018. bool merge = true;
  1019. int i = skb_shinfo(skb)->nr_frags;
  1020. struct page_frag *pfrag = sk_page_frag(sk);
  1021. if (!sk_page_frag_refill(sk, pfrag))
  1022. goto wait_for_memory;
  1023. if (!skb_can_coalesce(skb, i, pfrag->page,
  1024. pfrag->offset)) {
  1025. if (i == MAX_SKB_FRAGS || !sg) {
  1026. tcp_mark_push(tp, skb);
  1027. goto new_segment;
  1028. }
  1029. merge = false;
  1030. }
  1031. copy = min_t(int, copy, pfrag->size - pfrag->offset);
  1032. if (!sk_wmem_schedule(sk, copy))
  1033. goto wait_for_memory;
  1034. err = skb_copy_to_page_nocache(sk, from, skb,
  1035. pfrag->page,
  1036. pfrag->offset,
  1037. copy);
  1038. if (err)
  1039. goto do_error;
  1040. /* Update the skb. */
  1041. if (merge) {
  1042. skb_frag_size_add(&skb_shinfo(skb)->frags[i - 1], copy);
  1043. } else {
  1044. skb_fill_page_desc(skb, i, pfrag->page,
  1045. pfrag->offset, copy);
  1046. get_page(pfrag->page);
  1047. }
  1048. pfrag->offset += copy;
  1049. }
  1050. if (!copied)
  1051. TCP_SKB_CB(skb)->tcp_flags &= ~TCPHDR_PSH;
  1052. tp->write_seq += copy;
  1053. TCP_SKB_CB(skb)->end_seq += copy;
  1054. skb_shinfo(skb)->gso_segs = 0;
  1055. from += copy;
  1056. copied += copy;
  1057. if ((seglen -= copy) == 0 && iovlen == 0)
  1058. goto out;
  1059. if (skb->len < max || (flags & MSG_OOB) || unlikely(tp->repair))
  1060. continue;
  1061. if (forced_push(tp)) {
  1062. tcp_mark_push(tp, skb);
  1063. __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_PUSH);
  1064. } else if (skb == tcp_send_head(sk))
  1065. tcp_push_one(sk, mss_now);
  1066. continue;
  1067. wait_for_sndbuf:
  1068. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  1069. wait_for_memory:
  1070. if (copied)
  1071. tcp_push(sk, flags & ~MSG_MORE, mss_now, TCP_NAGLE_PUSH);
  1072. if ((err = sk_stream_wait_memory(sk, &timeo)) != 0)
  1073. goto do_error;
  1074. mss_now = tcp_send_mss(sk, &size_goal, flags);
  1075. }
  1076. }
  1077. out:
  1078. if (copied)
  1079. tcp_push(sk, flags, mss_now, tp->nonagle);
  1080. release_sock(sk);
  1081. return copied + copied_syn;
  1082. do_fault:
  1083. if (!skb->len) {
  1084. tcp_unlink_write_queue(skb, sk);
  1085. /* It is the one place in all of TCP, except connection
  1086. * reset, where we can be unlinking the send_head.
  1087. */
  1088. tcp_check_send_head(sk, skb);
  1089. sk_wmem_free_skb(sk, skb);
  1090. }
  1091. do_error:
  1092. if (copied + copied_syn)
  1093. goto out;
  1094. out_err:
  1095. err = sk_stream_error(sk, flags, err);
  1096. release_sock(sk);
  1097. return err;
  1098. }
  1099. EXPORT_SYMBOL(tcp_sendmsg);
  1100. /*
  1101. * Handle reading urgent data. BSD has very simple semantics for
  1102. * this, no blocking and very strange errors 8)
  1103. */
  1104. static int tcp_recv_urg(struct sock *sk, struct msghdr *msg, int len, int flags)
  1105. {
  1106. struct tcp_sock *tp = tcp_sk(sk);
  1107. /* No URG data to read. */
  1108. if (sock_flag(sk, SOCK_URGINLINE) || !tp->urg_data ||
  1109. tp->urg_data == TCP_URG_READ)
  1110. return -EINVAL; /* Yes this is right ! */
  1111. if (sk->sk_state == TCP_CLOSE && !sock_flag(sk, SOCK_DONE))
  1112. return -ENOTCONN;
  1113. if (tp->urg_data & TCP_URG_VALID) {
  1114. int err = 0;
  1115. char c = tp->urg_data;
  1116. if (!(flags & MSG_PEEK))
  1117. tp->urg_data = TCP_URG_READ;
  1118. /* Read urgent data. */
  1119. msg->msg_flags |= MSG_OOB;
  1120. if (len > 0) {
  1121. if (!(flags & MSG_TRUNC))
  1122. err = memcpy_toiovec(msg->msg_iov, &c, 1);
  1123. len = 1;
  1124. } else
  1125. msg->msg_flags |= MSG_TRUNC;
  1126. return err ? -EFAULT : len;
  1127. }
  1128. if (sk->sk_state == TCP_CLOSE || (sk->sk_shutdown & RCV_SHUTDOWN))
  1129. return 0;
  1130. /* Fixed the recv(..., MSG_OOB) behaviour. BSD docs and
  1131. * the available implementations agree in this case:
  1132. * this call should never block, independent of the
  1133. * blocking state of the socket.
  1134. * Mike <pall@rz.uni-karlsruhe.de>
  1135. */
  1136. return -EAGAIN;
  1137. }
  1138. static int tcp_peek_sndq(struct sock *sk, struct msghdr *msg, int len)
  1139. {
  1140. struct sk_buff *skb;
  1141. int copied = 0, err = 0;
  1142. /* XXX -- need to support SO_PEEK_OFF */
  1143. skb_queue_walk(&sk->sk_write_queue, skb) {
  1144. err = skb_copy_datagram_iovec(skb, 0, msg->msg_iov, skb->len);
  1145. if (err)
  1146. break;
  1147. copied += skb->len;
  1148. }
  1149. return err ?: copied;
  1150. }
  1151. /* Clean up the receive buffer for full frames taken by the user,
  1152. * then send an ACK if necessary. COPIED is the number of bytes
  1153. * tcp_recvmsg has given to the user so far, it speeds up the
  1154. * calculation of whether or not we must ACK for the sake of
  1155. * a window update.
  1156. */
  1157. void tcp_cleanup_rbuf(struct sock *sk, int copied)
  1158. {
  1159. struct tcp_sock *tp = tcp_sk(sk);
  1160. bool time_to_ack = false;
  1161. struct sk_buff *skb = skb_peek(&sk->sk_receive_queue);
  1162. WARN(skb && !before(tp->copied_seq, TCP_SKB_CB(skb)->end_seq),
  1163. "cleanup rbuf bug: copied %X seq %X rcvnxt %X\n",
  1164. tp->copied_seq, TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt);
  1165. if (inet_csk_ack_scheduled(sk)) {
  1166. const struct inet_connection_sock *icsk = inet_csk(sk);
  1167. /* Delayed ACKs frequently hit locked sockets during bulk
  1168. * receive. */
  1169. if (icsk->icsk_ack.blocked ||
  1170. /* Once-per-two-segments ACK was not sent by tcp_input.c */
  1171. tp->rcv_nxt - tp->rcv_wup > icsk->icsk_ack.rcv_mss ||
  1172. /*
  1173. * If this read emptied read buffer, we send ACK, if
  1174. * connection is not bidirectional, user drained
  1175. * receive buffer and there was a small segment
  1176. * in queue.
  1177. */
  1178. (copied > 0 &&
  1179. ((icsk->icsk_ack.pending & ICSK_ACK_PUSHED2) ||
  1180. ((icsk->icsk_ack.pending & ICSK_ACK_PUSHED) &&
  1181. !icsk->icsk_ack.pingpong)) &&
  1182. !atomic_read(&sk->sk_rmem_alloc)))
  1183. time_to_ack = true;
  1184. }
  1185. /* We send an ACK if we can now advertise a non-zero window
  1186. * which has been raised "significantly".
  1187. *
  1188. * Even if window raised up to infinity, do not send window open ACK
  1189. * in states, where we will not receive more. It is useless.
  1190. */
  1191. if (copied > 0 && !time_to_ack && !(sk->sk_shutdown & RCV_SHUTDOWN)) {
  1192. __u32 rcv_window_now = tcp_receive_window(tp);
  1193. /* Optimize, __tcp_select_window() is not cheap. */
  1194. if (2*rcv_window_now <= tp->window_clamp) {
  1195. __u32 new_window = __tcp_select_window(sk);
  1196. /* Send ACK now, if this read freed lots of space
  1197. * in our buffer. Certainly, new_window is new window.
  1198. * We can advertise it now, if it is not less than current one.
  1199. * "Lots" means "at least twice" here.
  1200. */
  1201. if (new_window && new_window >= 2 * rcv_window_now)
  1202. time_to_ack = true;
  1203. }
  1204. }
  1205. if (time_to_ack)
  1206. tcp_send_ack(sk);
  1207. }
  1208. static void tcp_prequeue_process(struct sock *sk)
  1209. {
  1210. struct sk_buff *skb;
  1211. struct tcp_sock *tp = tcp_sk(sk);
  1212. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPPREQUEUED);
  1213. /* RX process wants to run with disabled BHs, though it is not
  1214. * necessary */
  1215. local_bh_disable();
  1216. while ((skb = __skb_dequeue(&tp->ucopy.prequeue)) != NULL)
  1217. sk_backlog_rcv(sk, skb);
  1218. local_bh_enable();
  1219. /* Clear memory counter. */
  1220. tp->ucopy.memory = 0;
  1221. }
  1222. #ifdef CONFIG_NET_DMA
  1223. static void tcp_service_net_dma(struct sock *sk, bool wait)
  1224. {
  1225. dma_cookie_t done, used;
  1226. dma_cookie_t last_issued;
  1227. struct tcp_sock *tp = tcp_sk(sk);
  1228. if (!tp->ucopy.dma_chan)
  1229. return;
  1230. last_issued = tp->ucopy.dma_cookie;
  1231. dma_async_issue_pending(tp->ucopy.dma_chan);
  1232. do {
  1233. if (dma_async_is_tx_complete(tp->ucopy.dma_chan,
  1234. last_issued, &done,
  1235. &used) == DMA_SUCCESS) {
  1236. /* Safe to free early-copied skbs now */
  1237. __skb_queue_purge(&sk->sk_async_wait_queue);
  1238. break;
  1239. } else {
  1240. struct sk_buff *skb;
  1241. while ((skb = skb_peek(&sk->sk_async_wait_queue)) &&
  1242. (dma_async_is_complete(skb->dma_cookie, done,
  1243. used) == DMA_SUCCESS)) {
  1244. __skb_dequeue(&sk->sk_async_wait_queue);
  1245. kfree_skb(skb);
  1246. }
  1247. }
  1248. } while (wait);
  1249. }
  1250. #endif
  1251. static struct sk_buff *tcp_recv_skb(struct sock *sk, u32 seq, u32 *off)
  1252. {
  1253. struct sk_buff *skb;
  1254. u32 offset;
  1255. while ((skb = skb_peek(&sk->sk_receive_queue)) != NULL) {
  1256. offset = seq - TCP_SKB_CB(skb)->seq;
  1257. if (tcp_hdr(skb)->syn)
  1258. offset--;
  1259. if (offset < skb->len || tcp_hdr(skb)->fin) {
  1260. *off = offset;
  1261. return skb;
  1262. }
  1263. /* This looks weird, but this can happen if TCP collapsing
  1264. * splitted a fat GRO packet, while we released socket lock
  1265. * in skb_splice_bits()
  1266. */
  1267. sk_eat_skb(sk, skb, false);
  1268. }
  1269. return NULL;
  1270. }
  1271. /*
  1272. * This routine provides an alternative to tcp_recvmsg() for routines
  1273. * that would like to handle copying from skbuffs directly in 'sendfile'
  1274. * fashion.
  1275. * Note:
  1276. * - It is assumed that the socket was locked by the caller.
  1277. * - The routine does not block.
  1278. * - At present, there is no support for reading OOB data
  1279. * or for 'peeking' the socket using this routine
  1280. * (although both would be easy to implement).
  1281. */
  1282. int tcp_read_sock(struct sock *sk, read_descriptor_t *desc,
  1283. sk_read_actor_t recv_actor)
  1284. {
  1285. struct sk_buff *skb;
  1286. struct tcp_sock *tp = tcp_sk(sk);
  1287. u32 seq = tp->copied_seq;
  1288. u32 offset;
  1289. int copied = 0;
  1290. if (sk->sk_state == TCP_LISTEN)
  1291. return -ENOTCONN;
  1292. while ((skb = tcp_recv_skb(sk, seq, &offset)) != NULL) {
  1293. if (offset < skb->len) {
  1294. int used;
  1295. size_t len;
  1296. len = skb->len - offset;
  1297. /* Stop reading if we hit a patch of urgent data */
  1298. if (tp->urg_data) {
  1299. u32 urg_offset = tp->urg_seq - seq;
  1300. if (urg_offset < len)
  1301. len = urg_offset;
  1302. if (!len)
  1303. break;
  1304. }
  1305. used = recv_actor(desc, skb, offset, len);
  1306. if (used <= 0) {
  1307. if (!copied)
  1308. copied = used;
  1309. break;
  1310. } else if (used <= len) {
  1311. seq += used;
  1312. copied += used;
  1313. offset += used;
  1314. }
  1315. /* If recv_actor drops the lock (e.g. TCP splice
  1316. * receive) the skb pointer might be invalid when
  1317. * getting here: tcp_collapse might have deleted it
  1318. * while aggregating skbs from the socket queue.
  1319. */
  1320. skb = tcp_recv_skb(sk, seq - 1, &offset);
  1321. if (!skb)
  1322. break;
  1323. /* TCP coalescing might have appended data to the skb.
  1324. * Try to splice more frags
  1325. */
  1326. if (offset + 1 != skb->len)
  1327. continue;
  1328. }
  1329. if (tcp_hdr(skb)->fin) {
  1330. sk_eat_skb(sk, skb, false);
  1331. ++seq;
  1332. break;
  1333. }
  1334. sk_eat_skb(sk, skb, false);
  1335. if (!desc->count)
  1336. break;
  1337. tp->copied_seq = seq;
  1338. }
  1339. tp->copied_seq = seq;
  1340. tcp_rcv_space_adjust(sk);
  1341. /* Clean up data we have read: This will do ACK frames. */
  1342. if (copied > 0) {
  1343. tcp_recv_skb(sk, seq, &offset);
  1344. tcp_cleanup_rbuf(sk, copied);
  1345. }
  1346. return copied;
  1347. }
  1348. EXPORT_SYMBOL(tcp_read_sock);
  1349. /*
  1350. * This routine copies from a sock struct into the user buffer.
  1351. *
  1352. * Technical note: in 2.3 we work on _locked_ socket, so that
  1353. * tricks with *seq access order and skb->users are not required.
  1354. * Probably, code can be easily improved even more.
  1355. */
  1356. int tcp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
  1357. size_t len, int nonblock, int flags, int *addr_len)
  1358. {
  1359. struct tcp_sock *tp = tcp_sk(sk);
  1360. int copied = 0;
  1361. u32 peek_seq;
  1362. u32 *seq;
  1363. unsigned long used;
  1364. int err;
  1365. int target; /* Read at least this many bytes */
  1366. long timeo;
  1367. struct task_struct *user_recv = NULL;
  1368. bool copied_early = false;
  1369. struct sk_buff *skb;
  1370. u32 urg_hole = 0;
  1371. if (sk_can_busy_loop(sk) && skb_queue_empty(&sk->sk_receive_queue) &&
  1372. (sk->sk_state == TCP_ESTABLISHED))
  1373. sk_busy_loop(sk, nonblock);
  1374. lock_sock(sk);
  1375. err = -ENOTCONN;
  1376. if (sk->sk_state == TCP_LISTEN)
  1377. goto out;
  1378. timeo = sock_rcvtimeo(sk, nonblock);
  1379. /* Urgent data needs to be handled specially. */
  1380. if (flags & MSG_OOB)
  1381. goto recv_urg;
  1382. if (unlikely(tp->repair)) {
  1383. err = -EPERM;
  1384. if (!(flags & MSG_PEEK))
  1385. goto out;
  1386. if (tp->repair_queue == TCP_SEND_QUEUE)
  1387. goto recv_sndq;
  1388. err = -EINVAL;
  1389. if (tp->repair_queue == TCP_NO_QUEUE)
  1390. goto out;
  1391. /* 'common' recv queue MSG_PEEK-ing */
  1392. }
  1393. seq = &tp->copied_seq;
  1394. if (flags & MSG_PEEK) {
  1395. peek_seq = tp->copied_seq;
  1396. seq = &peek_seq;
  1397. }
  1398. target = sock_rcvlowat(sk, flags & MSG_WAITALL, len);
  1399. #ifdef CONFIG_NET_DMA
  1400. tp->ucopy.dma_chan = NULL;
  1401. preempt_disable();
  1402. skb = skb_peek_tail(&sk->sk_receive_queue);
  1403. {
  1404. int available = 0;
  1405. if (skb)
  1406. available = TCP_SKB_CB(skb)->seq + skb->len - (*seq);
  1407. if ((available < target) &&
  1408. (len > sysctl_tcp_dma_copybreak) && !(flags & MSG_PEEK) &&
  1409. !sysctl_tcp_low_latency &&
  1410. net_dma_find_channel()) {
  1411. preempt_enable_no_resched();
  1412. tp->ucopy.pinned_list =
  1413. dma_pin_iovec_pages(msg->msg_iov, len);
  1414. } else {
  1415. preempt_enable_no_resched();
  1416. }
  1417. }
  1418. #endif
  1419. do {
  1420. u32 offset;
  1421. /* Are we at urgent data? Stop if we have read anything or have SIGURG pending. */
  1422. if (tp->urg_data && tp->urg_seq == *seq) {
  1423. if (copied)
  1424. break;
  1425. if (signal_pending(current)) {
  1426. copied = timeo ? sock_intr_errno(timeo) : -EAGAIN;
  1427. break;
  1428. }
  1429. }
  1430. /* Next get a buffer. */
  1431. skb_queue_walk(&sk->sk_receive_queue, skb) {
  1432. /* Now that we have two receive queues this
  1433. * shouldn't happen.
  1434. */
  1435. if (WARN(before(*seq, TCP_SKB_CB(skb)->seq),
  1436. "recvmsg bug: copied %X seq %X rcvnxt %X fl %X\n",
  1437. *seq, TCP_SKB_CB(skb)->seq, tp->rcv_nxt,
  1438. flags))
  1439. break;
  1440. offset = *seq - TCP_SKB_CB(skb)->seq;
  1441. if (tcp_hdr(skb)->syn)
  1442. offset--;
  1443. if (offset < skb->len)
  1444. goto found_ok_skb;
  1445. if (tcp_hdr(skb)->fin)
  1446. goto found_fin_ok;
  1447. WARN(!(flags & MSG_PEEK),
  1448. "recvmsg bug 2: copied %X seq %X rcvnxt %X fl %X\n",
  1449. *seq, TCP_SKB_CB(skb)->seq, tp->rcv_nxt, flags);
  1450. }
  1451. /* Well, if we have backlog, try to process it now yet. */
  1452. if (copied >= target && !sk->sk_backlog.tail)
  1453. break;
  1454. if (copied) {
  1455. if (sk->sk_err ||
  1456. sk->sk_state == TCP_CLOSE ||
  1457. (sk->sk_shutdown & RCV_SHUTDOWN) ||
  1458. !timeo ||
  1459. signal_pending(current))
  1460. break;
  1461. } else {
  1462. if (sock_flag(sk, SOCK_DONE))
  1463. break;
  1464. if (sk->sk_err) {
  1465. copied = sock_error(sk);
  1466. break;
  1467. }
  1468. if (sk->sk_shutdown & RCV_SHUTDOWN)
  1469. break;
  1470. if (sk->sk_state == TCP_CLOSE) {
  1471. if (!sock_flag(sk, SOCK_DONE)) {
  1472. /* This occurs when user tries to read
  1473. * from never connected socket.
  1474. */
  1475. copied = -ENOTCONN;
  1476. break;
  1477. }
  1478. break;
  1479. }
  1480. if (!timeo) {
  1481. copied = -EAGAIN;
  1482. break;
  1483. }
  1484. if (signal_pending(current)) {
  1485. copied = sock_intr_errno(timeo);
  1486. break;
  1487. }
  1488. }
  1489. tcp_cleanup_rbuf(sk, copied);
  1490. if (!sysctl_tcp_low_latency && tp->ucopy.task == user_recv) {
  1491. /* Install new reader */
  1492. if (!user_recv && !(flags & (MSG_TRUNC | MSG_PEEK))) {
  1493. user_recv = current;
  1494. tp->ucopy.task = user_recv;
  1495. tp->ucopy.iov = msg->msg_iov;
  1496. }
  1497. tp->ucopy.len = len;
  1498. WARN_ON(tp->copied_seq != tp->rcv_nxt &&
  1499. !(flags & (MSG_PEEK | MSG_TRUNC)));
  1500. /* Ugly... If prequeue is not empty, we have to
  1501. * process it before releasing socket, otherwise
  1502. * order will be broken at second iteration.
  1503. * More elegant solution is required!!!
  1504. *
  1505. * Look: we have the following (pseudo)queues:
  1506. *
  1507. * 1. packets in flight
  1508. * 2. backlog
  1509. * 3. prequeue
  1510. * 4. receive_queue
  1511. *
  1512. * Each queue can be processed only if the next ones
  1513. * are empty. At this point we have empty receive_queue.
  1514. * But prequeue _can_ be not empty after 2nd iteration,
  1515. * when we jumped to start of loop because backlog
  1516. * processing added something to receive_queue.
  1517. * We cannot release_sock(), because backlog contains
  1518. * packets arrived _after_ prequeued ones.
  1519. *
  1520. * Shortly, algorithm is clear --- to process all
  1521. * the queues in order. We could make it more directly,
  1522. * requeueing packets from backlog to prequeue, if
  1523. * is not empty. It is more elegant, but eats cycles,
  1524. * unfortunately.
  1525. */
  1526. if (!skb_queue_empty(&tp->ucopy.prequeue))
  1527. goto do_prequeue;
  1528. /* __ Set realtime policy in scheduler __ */
  1529. }
  1530. #ifdef CONFIG_NET_DMA
  1531. if (tp->ucopy.dma_chan) {
  1532. if (tp->rcv_wnd == 0 &&
  1533. !skb_queue_empty(&sk->sk_async_wait_queue)) {
  1534. tcp_service_net_dma(sk, true);
  1535. tcp_cleanup_rbuf(sk, copied);
  1536. } else
  1537. dma_async_issue_pending(tp->ucopy.dma_chan);
  1538. }
  1539. #endif
  1540. if (copied >= target) {
  1541. /* Do not sleep, just process backlog. */
  1542. release_sock(sk);
  1543. lock_sock(sk);
  1544. } else
  1545. sk_wait_data(sk, &timeo);
  1546. #ifdef CONFIG_NET_DMA
  1547. tcp_service_net_dma(sk, false); /* Don't block */
  1548. tp->ucopy.wakeup = 0;
  1549. #endif
  1550. if (user_recv) {
  1551. int chunk;
  1552. /* __ Restore normal policy in scheduler __ */
  1553. if ((chunk = len - tp->ucopy.len) != 0) {
  1554. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMBACKLOG, chunk);
  1555. len -= chunk;
  1556. copied += chunk;
  1557. }
  1558. if (tp->rcv_nxt == tp->copied_seq &&
  1559. !skb_queue_empty(&tp->ucopy.prequeue)) {
  1560. do_prequeue:
  1561. tcp_prequeue_process(sk);
  1562. if ((chunk = len - tp->ucopy.len) != 0) {
  1563. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE, chunk);
  1564. len -= chunk;
  1565. copied += chunk;
  1566. }
  1567. }
  1568. }
  1569. if ((flags & MSG_PEEK) &&
  1570. (peek_seq - copied - urg_hole != tp->copied_seq)) {
  1571. net_dbg_ratelimited("TCP(%s:%d): Application bug, race in MSG_PEEK\n",
  1572. current->comm,
  1573. task_pid_nr(current));
  1574. peek_seq = tp->copied_seq;
  1575. }
  1576. continue;
  1577. found_ok_skb:
  1578. /* Ok so how much can we use? */
  1579. used = skb->len - offset;
  1580. if (len < used)
  1581. used = len;
  1582. /* Do we have urgent data here? */
  1583. if (tp->urg_data) {
  1584. u32 urg_offset = tp->urg_seq - *seq;
  1585. if (urg_offset < used) {
  1586. if (!urg_offset) {
  1587. if (!sock_flag(sk, SOCK_URGINLINE)) {
  1588. ++*seq;
  1589. urg_hole++;
  1590. offset++;
  1591. used--;
  1592. if (!used)
  1593. goto skip_copy;
  1594. }
  1595. } else
  1596. used = urg_offset;
  1597. }
  1598. }
  1599. if (!(flags & MSG_TRUNC)) {
  1600. #ifdef CONFIG_NET_DMA
  1601. if (!tp->ucopy.dma_chan && tp->ucopy.pinned_list)
  1602. tp->ucopy.dma_chan = net_dma_find_channel();
  1603. if (tp->ucopy.dma_chan) {
  1604. tp->ucopy.dma_cookie = dma_skb_copy_datagram_iovec(
  1605. tp->ucopy.dma_chan, skb, offset,
  1606. msg->msg_iov, used,
  1607. tp->ucopy.pinned_list);
  1608. if (tp->ucopy.dma_cookie < 0) {
  1609. pr_alert("%s: dma_cookie < 0\n",
  1610. __func__);
  1611. /* Exception. Bailout! */
  1612. if (!copied)
  1613. copied = -EFAULT;
  1614. break;
  1615. }
  1616. dma_async_issue_pending(tp->ucopy.dma_chan);
  1617. if ((offset + used) == skb->len)
  1618. copied_early = true;
  1619. } else
  1620. #endif
  1621. {
  1622. err = skb_copy_datagram_iovec(skb, offset,
  1623. msg->msg_iov, used);
  1624. if (err) {
  1625. /* Exception. Bailout! */
  1626. if (!copied)
  1627. copied = -EFAULT;
  1628. break;
  1629. }
  1630. }
  1631. }
  1632. *seq += used;
  1633. copied += used;
  1634. len -= used;
  1635. tcp_rcv_space_adjust(sk);
  1636. skip_copy:
  1637. if (tp->urg_data && after(tp->copied_seq, tp->urg_seq)) {
  1638. tp->urg_data = 0;
  1639. tcp_fast_path_check(sk);
  1640. }
  1641. if (used + offset < skb->len)
  1642. continue;
  1643. if (tcp_hdr(skb)->fin)
  1644. goto found_fin_ok;
  1645. if (!(flags & MSG_PEEK)) {
  1646. sk_eat_skb(sk, skb, copied_early);
  1647. copied_early = false;
  1648. }
  1649. continue;
  1650. found_fin_ok:
  1651. /* Process the FIN. */
  1652. ++*seq;
  1653. if (!(flags & MSG_PEEK)) {
  1654. sk_eat_skb(sk, skb, copied_early);
  1655. copied_early = false;
  1656. }
  1657. break;
  1658. } while (len > 0);
  1659. if (user_recv) {
  1660. if (!skb_queue_empty(&tp->ucopy.prequeue)) {
  1661. int chunk;
  1662. tp->ucopy.len = copied > 0 ? len : 0;
  1663. tcp_prequeue_process(sk);
  1664. if (copied > 0 && (chunk = len - tp->ucopy.len) != 0) {
  1665. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE, chunk);
  1666. len -= chunk;
  1667. copied += chunk;
  1668. }
  1669. }
  1670. tp->ucopy.task = NULL;
  1671. tp->ucopy.len = 0;
  1672. }
  1673. #ifdef CONFIG_NET_DMA
  1674. tcp_service_net_dma(sk, true); /* Wait for queue to drain */
  1675. tp->ucopy.dma_chan = NULL;
  1676. if (tp->ucopy.pinned_list) {
  1677. dma_unpin_iovec_pages(tp->ucopy.pinned_list);
  1678. tp->ucopy.pinned_list = NULL;
  1679. }
  1680. #endif
  1681. /* According to UNIX98, msg_name/msg_namelen are ignored
  1682. * on connected socket. I was just happy when found this 8) --ANK
  1683. */
  1684. /* Clean up data we have read: This will do ACK frames. */
  1685. tcp_cleanup_rbuf(sk, copied);
  1686. release_sock(sk);
  1687. return copied;
  1688. out:
  1689. release_sock(sk);
  1690. return err;
  1691. recv_urg:
  1692. err = tcp_recv_urg(sk, msg, len, flags);
  1693. goto out;
  1694. recv_sndq:
  1695. err = tcp_peek_sndq(sk, msg, len);
  1696. goto out;
  1697. }
  1698. EXPORT_SYMBOL(tcp_recvmsg);
  1699. void tcp_set_state(struct sock *sk, int state)
  1700. {
  1701. int oldstate = sk->sk_state;
  1702. switch (state) {
  1703. case TCP_ESTABLISHED:
  1704. if (oldstate != TCP_ESTABLISHED)
  1705. TCP_INC_STATS(sock_net(sk), TCP_MIB_CURRESTAB);
  1706. break;
  1707. case TCP_CLOSE:
  1708. if (oldstate == TCP_CLOSE_WAIT || oldstate == TCP_ESTABLISHED)
  1709. TCP_INC_STATS(sock_net(sk), TCP_MIB_ESTABRESETS);
  1710. sk->sk_prot->unhash(sk);
  1711. if (inet_csk(sk)->icsk_bind_hash &&
  1712. !(sk->sk_userlocks & SOCK_BINDPORT_LOCK))
  1713. inet_put_port(sk);
  1714. /* fall through */
  1715. default:
  1716. if (oldstate == TCP_ESTABLISHED)
  1717. TCP_DEC_STATS(sock_net(sk), TCP_MIB_CURRESTAB);
  1718. }
  1719. /* Change state AFTER socket is unhashed to avoid closed
  1720. * socket sitting in hash tables.
  1721. */
  1722. sk->sk_state = state;
  1723. #ifdef STATE_TRACE
  1724. SOCK_DEBUG(sk, "TCP sk=%p, State %s -> %s\n", sk, statename[oldstate], statename[state]);
  1725. #endif
  1726. }
  1727. EXPORT_SYMBOL_GPL(tcp_set_state);
  1728. /*
  1729. * State processing on a close. This implements the state shift for
  1730. * sending our FIN frame. Note that we only send a FIN for some
  1731. * states. A shutdown() may have already sent the FIN, or we may be
  1732. * closed.
  1733. */
  1734. static const unsigned char new_state[16] = {
  1735. /* current state: new state: action: */
  1736. /* (Invalid) */ TCP_CLOSE,
  1737. /* TCP_ESTABLISHED */ TCP_FIN_WAIT1 | TCP_ACTION_FIN,
  1738. /* TCP_SYN_SENT */ TCP_CLOSE,
  1739. /* TCP_SYN_RECV */ TCP_FIN_WAIT1 | TCP_ACTION_FIN,
  1740. /* TCP_FIN_WAIT1 */ TCP_FIN_WAIT1,
  1741. /* TCP_FIN_WAIT2 */ TCP_FIN_WAIT2,
  1742. /* TCP_TIME_WAIT */ TCP_CLOSE,
  1743. /* TCP_CLOSE */ TCP_CLOSE,
  1744. /* TCP_CLOSE_WAIT */ TCP_LAST_ACK | TCP_ACTION_FIN,
  1745. /* TCP_LAST_ACK */ TCP_LAST_ACK,
  1746. /* TCP_LISTEN */ TCP_CLOSE,
  1747. /* TCP_CLOSING */ TCP_CLOSING,
  1748. };
  1749. static int tcp_close_state(struct sock *sk)
  1750. {
  1751. int next = (int)new_state[sk->sk_state];
  1752. int ns = next & TCP_STATE_MASK;
  1753. tcp_set_state(sk, ns);
  1754. return next & TCP_ACTION_FIN;
  1755. }
  1756. /*
  1757. * Shutdown the sending side of a connection. Much like close except
  1758. * that we don't receive shut down or sock_set_flag(sk, SOCK_DEAD).
  1759. */
  1760. void tcp_shutdown(struct sock *sk, int how)
  1761. {
  1762. /* We need to grab some memory, and put together a FIN,
  1763. * and then put it into the queue to be sent.
  1764. * Tim MacKenzie(tym@dibbler.cs.monash.edu.au) 4 Dec '92.
  1765. */
  1766. if (!(how & SEND_SHUTDOWN))
  1767. return;
  1768. /* If we've already sent a FIN, or it's a closed state, skip this. */
  1769. if ((1 << sk->sk_state) &
  1770. (TCPF_ESTABLISHED | TCPF_SYN_SENT |
  1771. TCPF_SYN_RECV | TCPF_CLOSE_WAIT)) {
  1772. /* Clear out any half completed packets. FIN if needed. */
  1773. if (tcp_close_state(sk))
  1774. tcp_send_fin(sk);
  1775. }
  1776. }
  1777. EXPORT_SYMBOL(tcp_shutdown);
  1778. bool tcp_check_oom(struct sock *sk, int shift)
  1779. {
  1780. bool too_many_orphans, out_of_socket_memory;
  1781. too_many_orphans = tcp_too_many_orphans(sk, shift);
  1782. out_of_socket_memory = tcp_out_of_memory(sk);
  1783. if (too_many_orphans)
  1784. net_info_ratelimited("too many orphaned sockets\n");
  1785. if (out_of_socket_memory)
  1786. net_info_ratelimited("out of memory -- consider tuning tcp_mem\n");
  1787. return too_many_orphans || out_of_socket_memory;
  1788. }
  1789. void tcp_close(struct sock *sk, long timeout)
  1790. {
  1791. struct sk_buff *skb;
  1792. int data_was_unread = 0;
  1793. int state;
  1794. lock_sock(sk);
  1795. sk->sk_shutdown = SHUTDOWN_MASK;
  1796. if (sk->sk_state == TCP_LISTEN) {
  1797. tcp_set_state(sk, TCP_CLOSE);
  1798. /* Special case. */
  1799. inet_csk_listen_stop(sk);
  1800. goto adjudge_to_death;
  1801. }
  1802. /* We need to flush the recv. buffs. We do this only on the
  1803. * descriptor close, not protocol-sourced closes, because the
  1804. * reader process may not have drained the data yet!
  1805. */
  1806. while ((skb = __skb_dequeue(&sk->sk_receive_queue)) != NULL) {
  1807. u32 len = TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq -
  1808. tcp_hdr(skb)->fin;
  1809. data_was_unread += len;
  1810. __kfree_skb(skb);
  1811. }
  1812. sk_mem_reclaim(sk);
  1813. /* If socket has been already reset (e.g. in tcp_reset()) - kill it. */
  1814. if (sk->sk_state == TCP_CLOSE)
  1815. goto adjudge_to_death;
  1816. /* As outlined in RFC 2525, section 2.17, we send a RST here because
  1817. * data was lost. To witness the awful effects of the old behavior of
  1818. * always doing a FIN, run an older 2.1.x kernel or 2.0.x, start a bulk
  1819. * GET in an FTP client, suspend the process, wait for the client to
  1820. * advertise a zero window, then kill -9 the FTP client, wheee...
  1821. * Note: timeout is always zero in such a case.
  1822. */
  1823. if (unlikely(tcp_sk(sk)->repair)) {
  1824. sk->sk_prot->disconnect(sk, 0);
  1825. } else if (data_was_unread) {
  1826. /* Unread data was tossed, zap the connection. */
  1827. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPABORTONCLOSE);
  1828. tcp_set_state(sk, TCP_CLOSE);
  1829. tcp_send_active_reset(sk, sk->sk_allocation);
  1830. } else if (sock_flag(sk, SOCK_LINGER) && !sk->sk_lingertime) {
  1831. /* Check zero linger _after_ checking for unread data. */
  1832. sk->sk_prot->disconnect(sk, 0);
  1833. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPABORTONDATA);
  1834. } else if (tcp_close_state(sk)) {
  1835. /* We FIN if the application ate all the data before
  1836. * zapping the connection.
  1837. */
  1838. /* RED-PEN. Formally speaking, we have broken TCP state
  1839. * machine. State transitions:
  1840. *
  1841. * TCP_ESTABLISHED -> TCP_FIN_WAIT1
  1842. * TCP_SYN_RECV -> TCP_FIN_WAIT1 (forget it, it's impossible)
  1843. * TCP_CLOSE_WAIT -> TCP_LAST_ACK
  1844. *
  1845. * are legal only when FIN has been sent (i.e. in window),
  1846. * rather than queued out of window. Purists blame.
  1847. *
  1848. * F.e. "RFC state" is ESTABLISHED,
  1849. * if Linux state is FIN-WAIT-1, but FIN is still not sent.
  1850. *
  1851. * The visible declinations are that sometimes
  1852. * we enter time-wait state, when it is not required really
  1853. * (harmless), do not send active resets, when they are
  1854. * required by specs (TCP_ESTABLISHED, TCP_CLOSE_WAIT, when
  1855. * they look as CLOSING or LAST_ACK for Linux)
  1856. * Probably, I missed some more holelets.
  1857. * --ANK
  1858. * XXX (TFO) - To start off we don't support SYN+ACK+FIN
  1859. * in a single packet! (May consider it later but will
  1860. * probably need API support or TCP_CORK SYN-ACK until
  1861. * data is written and socket is closed.)
  1862. */
  1863. tcp_send_fin(sk);
  1864. }
  1865. sk_stream_wait_close(sk, timeout);
  1866. adjudge_to_death:
  1867. state = sk->sk_state;
  1868. sock_hold(sk);
  1869. sock_orphan(sk);
  1870. /* It is the last release_sock in its life. It will remove backlog. */
  1871. release_sock(sk);
  1872. /* Now socket is owned by kernel and we acquire BH lock
  1873. to finish close. No need to check for user refs.
  1874. */
  1875. local_bh_disable();
  1876. bh_lock_sock(sk);
  1877. WARN_ON(sock_owned_by_user(sk));
  1878. percpu_counter_inc(sk->sk_prot->orphan_count);
  1879. /* Have we already been destroyed by a softirq or backlog? */
  1880. if (state != TCP_CLOSE && sk->sk_state == TCP_CLOSE)
  1881. goto out;
  1882. /* This is a (useful) BSD violating of the RFC. There is a
  1883. * problem with TCP as specified in that the other end could
  1884. * keep a socket open forever with no application left this end.
  1885. * We use a 3 minute timeout (about the same as BSD) then kill
  1886. * our end. If they send after that then tough - BUT: long enough
  1887. * that we won't make the old 4*rto = almost no time - whoops
  1888. * reset mistake.
  1889. *
  1890. * Nope, it was not mistake. It is really desired behaviour
  1891. * f.e. on http servers, when such sockets are useless, but
  1892. * consume significant resources. Let's do it with special
  1893. * linger2 option. --ANK
  1894. */
  1895. if (sk->sk_state == TCP_FIN_WAIT2) {
  1896. struct tcp_sock *tp = tcp_sk(sk);
  1897. if (tp->linger2 < 0) {
  1898. tcp_set_state(sk, TCP_CLOSE);
  1899. tcp_send_active_reset(sk, GFP_ATOMIC);
  1900. NET_INC_STATS_BH(sock_net(sk),
  1901. LINUX_MIB_TCPABORTONLINGER);
  1902. } else {
  1903. const int tmo = tcp_fin_time(sk);
  1904. if (tmo > TCP_TIMEWAIT_LEN) {
  1905. inet_csk_reset_keepalive_timer(sk,
  1906. tmo - TCP_TIMEWAIT_LEN);
  1907. } else {
  1908. tcp_time_wait(sk, TCP_FIN_WAIT2, tmo);
  1909. goto out;
  1910. }
  1911. }
  1912. }
  1913. if (sk->sk_state != TCP_CLOSE) {
  1914. sk_mem_reclaim(sk);
  1915. if (tcp_check_oom(sk, 0)) {
  1916. tcp_set_state(sk, TCP_CLOSE);
  1917. tcp_send_active_reset(sk, GFP_ATOMIC);
  1918. NET_INC_STATS_BH(sock_net(sk),
  1919. LINUX_MIB_TCPABORTONMEMORY);
  1920. }
  1921. }
  1922. if (sk->sk_state == TCP_CLOSE) {
  1923. struct request_sock *req = tcp_sk(sk)->fastopen_rsk;
  1924. /* We could get here with a non-NULL req if the socket is
  1925. * aborted (e.g., closed with unread data) before 3WHS
  1926. * finishes.
  1927. */
  1928. if (req != NULL)
  1929. reqsk_fastopen_remove(sk, req, false);
  1930. inet_csk_destroy_sock(sk);
  1931. }
  1932. /* Otherwise, socket is reprieved until protocol close. */
  1933. out:
  1934. bh_unlock_sock(sk);
  1935. local_bh_enable();
  1936. sock_put(sk);
  1937. }
  1938. EXPORT_SYMBOL(tcp_close);
  1939. /* These states need RST on ABORT according to RFC793 */
  1940. static inline bool tcp_need_reset(int state)
  1941. {
  1942. return (1 << state) &
  1943. (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT | TCPF_FIN_WAIT1 |
  1944. TCPF_FIN_WAIT2 | TCPF_SYN_RECV);
  1945. }
  1946. int tcp_disconnect(struct sock *sk, int flags)
  1947. {
  1948. struct inet_sock *inet = inet_sk(sk);
  1949. struct inet_connection_sock *icsk = inet_csk(sk);
  1950. struct tcp_sock *tp = tcp_sk(sk);
  1951. int err = 0;
  1952. int old_state = sk->sk_state;
  1953. if (old_state != TCP_CLOSE)
  1954. tcp_set_state(sk, TCP_CLOSE);
  1955. /* ABORT function of RFC793 */
  1956. if (old_state == TCP_LISTEN) {
  1957. inet_csk_listen_stop(sk);
  1958. } else if (unlikely(tp->repair)) {
  1959. sk->sk_err = ECONNABORTED;
  1960. } else if (tcp_need_reset(old_state) ||
  1961. (tp->snd_nxt != tp->write_seq &&
  1962. (1 << old_state) & (TCPF_CLOSING | TCPF_LAST_ACK))) {
  1963. /* The last check adjusts for discrepancy of Linux wrt. RFC
  1964. * states
  1965. */
  1966. tcp_send_active_reset(sk, gfp_any());
  1967. sk->sk_err = ECONNRESET;
  1968. } else if (old_state == TCP_SYN_SENT)
  1969. sk->sk_err = ECONNRESET;
  1970. tcp_clear_xmit_timers(sk);
  1971. __skb_queue_purge(&sk->sk_receive_queue);
  1972. tcp_write_queue_purge(sk);
  1973. __skb_queue_purge(&tp->out_of_order_queue);
  1974. #ifdef CONFIG_NET_DMA
  1975. __skb_queue_purge(&sk->sk_async_wait_queue);
  1976. #endif
  1977. inet->inet_dport = 0;
  1978. if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
  1979. inet_reset_saddr(sk);
  1980. sk->sk_shutdown = 0;
  1981. sock_reset_flag(sk, SOCK_DONE);
  1982. tp->srtt = 0;
  1983. if ((tp->write_seq += tp->max_window + 2) == 0)
  1984. tp->write_seq = 1;
  1985. icsk->icsk_backoff = 0;
  1986. tp->snd_cwnd = 2;
  1987. icsk->icsk_probes_out = 0;
  1988. tp->packets_out = 0;
  1989. tp->snd_ssthresh = TCP_INFINITE_SSTHRESH;
  1990. tp->snd_cwnd_cnt = 0;
  1991. tp->window_clamp = 0;
  1992. tcp_set_ca_state(sk, TCP_CA_Open);
  1993. tcp_clear_retrans(tp);
  1994. inet_csk_delack_init(sk);
  1995. tcp_init_send_head(sk);
  1996. memset(&tp->rx_opt, 0, sizeof(tp->rx_opt));
  1997. __sk_dst_reset(sk);
  1998. WARN_ON(inet->inet_num && !icsk->icsk_bind_hash);
  1999. sk->sk_error_report(sk);
  2000. return err;
  2001. }
  2002. EXPORT_SYMBOL(tcp_disconnect);
  2003. void tcp_sock_destruct(struct sock *sk)
  2004. {
  2005. inet_sock_destruct(sk);
  2006. kfree(inet_csk(sk)->icsk_accept_queue.fastopenq);
  2007. }
  2008. static inline bool tcp_can_repair_sock(const struct sock *sk)
  2009. {
  2010. return ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN) &&
  2011. ((1 << sk->sk_state) & (TCPF_CLOSE | TCPF_ESTABLISHED));
  2012. }
  2013. static int tcp_repair_options_est(struct tcp_sock *tp,
  2014. struct tcp_repair_opt __user *optbuf, unsigned int len)
  2015. {
  2016. struct tcp_repair_opt opt;
  2017. while (len >= sizeof(opt)) {
  2018. if (copy_from_user(&opt, optbuf, sizeof(opt)))
  2019. return -EFAULT;
  2020. optbuf++;
  2021. len -= sizeof(opt);
  2022. switch (opt.opt_code) {
  2023. case TCPOPT_MSS:
  2024. tp->rx_opt.mss_clamp = opt.opt_val;
  2025. break;
  2026. case TCPOPT_WINDOW:
  2027. {
  2028. u16 snd_wscale = opt.opt_val & 0xFFFF;
  2029. u16 rcv_wscale = opt.opt_val >> 16;
  2030. if (snd_wscale > 14 || rcv_wscale > 14)
  2031. return -EFBIG;
  2032. tp->rx_opt.snd_wscale = snd_wscale;
  2033. tp->rx_opt.rcv_wscale = rcv_wscale;
  2034. tp->rx_opt.wscale_ok = 1;
  2035. }
  2036. break;
  2037. case TCPOPT_SACK_PERM:
  2038. if (opt.opt_val != 0)
  2039. return -EINVAL;
  2040. tp->rx_opt.sack_ok |= TCP_SACK_SEEN;
  2041. if (sysctl_tcp_fack)
  2042. tcp_enable_fack(tp);
  2043. break;
  2044. case TCPOPT_TIMESTAMP:
  2045. if (opt.opt_val != 0)
  2046. return -EINVAL;
  2047. tp->rx_opt.tstamp_ok = 1;
  2048. break;
  2049. }
  2050. }
  2051. return 0;
  2052. }
  2053. /*
  2054. * Socket option code for TCP.
  2055. */
  2056. static int do_tcp_setsockopt(struct sock *sk, int level,
  2057. int optname, char __user *optval, unsigned int optlen)
  2058. {
  2059. struct tcp_sock *tp = tcp_sk(sk);
  2060. struct inet_connection_sock *icsk = inet_csk(sk);
  2061. int val;
  2062. int err = 0;
  2063. /* These are data/string values, all the others are ints */
  2064. switch (optname) {
  2065. case TCP_CONGESTION: {
  2066. char name[TCP_CA_NAME_MAX];
  2067. if (optlen < 1)
  2068. return -EINVAL;
  2069. val = strncpy_from_user(name, optval,
  2070. min_t(long, TCP_CA_NAME_MAX-1, optlen));
  2071. if (val < 0)
  2072. return -EFAULT;
  2073. name[val] = 0;
  2074. lock_sock(sk);
  2075. err = tcp_set_congestion_control(sk, name);
  2076. release_sock(sk);
  2077. return err;
  2078. }
  2079. default:
  2080. /* fallthru */
  2081. break;
  2082. }
  2083. if (optlen < sizeof(int))
  2084. return -EINVAL;
  2085. if (get_user(val, (int __user *)optval))
  2086. return -EFAULT;
  2087. lock_sock(sk);
  2088. switch (optname) {
  2089. case TCP_MAXSEG:
  2090. /* Values greater than interface MTU won't take effect. However
  2091. * at the point when this call is done we typically don't yet
  2092. * know which interface is going to be used */
  2093. if (val < TCP_MIN_MSS || val > MAX_TCP_WINDOW) {
  2094. err = -EINVAL;
  2095. break;
  2096. }
  2097. tp->rx_opt.user_mss = val;
  2098. break;
  2099. case TCP_NODELAY:
  2100. if (val) {
  2101. /* TCP_NODELAY is weaker than TCP_CORK, so that
  2102. * this option on corked socket is remembered, but
  2103. * it is not activated until cork is cleared.
  2104. *
  2105. * However, when TCP_NODELAY is set we make
  2106. * an explicit push, which overrides even TCP_CORK
  2107. * for currently queued segments.
  2108. */
  2109. tp->nonagle |= TCP_NAGLE_OFF|TCP_NAGLE_PUSH;
  2110. tcp_push_pending_frames(sk);
  2111. } else {
  2112. tp->nonagle &= ~TCP_NAGLE_OFF;
  2113. }
  2114. break;
  2115. case TCP_THIN_LINEAR_TIMEOUTS:
  2116. if (val < 0 || val > 1)
  2117. err = -EINVAL;
  2118. else
  2119. tp->thin_lto = val;
  2120. break;
  2121. case TCP_THIN_DUPACK:
  2122. if (val < 0 || val > 1)
  2123. err = -EINVAL;
  2124. else {
  2125. tp->thin_dupack = val;
  2126. if (tp->thin_dupack)
  2127. tcp_disable_early_retrans(tp);
  2128. }
  2129. break;
  2130. case TCP_REPAIR:
  2131. if (!tcp_can_repair_sock(sk))
  2132. err = -EPERM;
  2133. else if (val == 1) {
  2134. tp->repair = 1;
  2135. sk->sk_reuse = SK_FORCE_REUSE;
  2136. tp->repair_queue = TCP_NO_QUEUE;
  2137. } else if (val == 0) {
  2138. tp->repair = 0;
  2139. sk->sk_reuse = SK_NO_REUSE;
  2140. tcp_send_window_probe(sk);
  2141. } else
  2142. err = -EINVAL;
  2143. break;
  2144. case TCP_REPAIR_QUEUE:
  2145. if (!tp->repair)
  2146. err = -EPERM;
  2147. else if (val < TCP_QUEUES_NR)
  2148. tp->repair_queue = val;
  2149. else
  2150. err = -EINVAL;
  2151. break;
  2152. case TCP_QUEUE_SEQ:
  2153. if (sk->sk_state != TCP_CLOSE)
  2154. err = -EPERM;
  2155. else if (tp->repair_queue == TCP_SEND_QUEUE)
  2156. tp->write_seq = val;
  2157. else if (tp->repair_queue == TCP_RECV_QUEUE)
  2158. tp->rcv_nxt = val;
  2159. else
  2160. err = -EINVAL;
  2161. break;
  2162. case TCP_REPAIR_OPTIONS:
  2163. if (!tp->repair)
  2164. err = -EINVAL;
  2165. else if (sk->sk_state == TCP_ESTABLISHED)
  2166. err = tcp_repair_options_est(tp,
  2167. (struct tcp_repair_opt __user *)optval,
  2168. optlen);
  2169. else
  2170. err = -EPERM;
  2171. break;
  2172. case TCP_CORK:
  2173. /* When set indicates to always queue non-full frames.
  2174. * Later the user clears this option and we transmit
  2175. * any pending partial frames in the queue. This is
  2176. * meant to be used alongside sendfile() to get properly
  2177. * filled frames when the user (for example) must write
  2178. * out headers with a write() call first and then use
  2179. * sendfile to send out the data parts.
  2180. *
  2181. * TCP_CORK can be set together with TCP_NODELAY and it is
  2182. * stronger than TCP_NODELAY.
  2183. */
  2184. if (val) {
  2185. tp->nonagle |= TCP_NAGLE_CORK;
  2186. } else {
  2187. tp->nonagle &= ~TCP_NAGLE_CORK;
  2188. if (tp->nonagle&TCP_NAGLE_OFF)
  2189. tp->nonagle |= TCP_NAGLE_PUSH;
  2190. tcp_push_pending_frames(sk);
  2191. }
  2192. break;
  2193. case TCP_KEEPIDLE:
  2194. if (val < 1 || val > MAX_TCP_KEEPIDLE)
  2195. err = -EINVAL;
  2196. else {
  2197. tp->keepalive_time = val * HZ;
  2198. if (sock_flag(sk, SOCK_KEEPOPEN) &&
  2199. !((1 << sk->sk_state) &
  2200. (TCPF_CLOSE | TCPF_LISTEN))) {
  2201. u32 elapsed = keepalive_time_elapsed(tp);
  2202. if (tp->keepalive_time > elapsed)
  2203. elapsed = tp->keepalive_time - elapsed;
  2204. else
  2205. elapsed = 0;
  2206. inet_csk_reset_keepalive_timer(sk, elapsed);
  2207. }
  2208. }
  2209. break;
  2210. case TCP_KEEPINTVL:
  2211. if (val < 1 || val > MAX_TCP_KEEPINTVL)
  2212. err = -EINVAL;
  2213. else
  2214. tp->keepalive_intvl = val * HZ;
  2215. break;
  2216. case TCP_KEEPCNT:
  2217. if (val < 1 || val > MAX_TCP_KEEPCNT)
  2218. err = -EINVAL;
  2219. else
  2220. tp->keepalive_probes = val;
  2221. break;
  2222. case TCP_SYNCNT:
  2223. if (val < 1 || val > MAX_TCP_SYNCNT)
  2224. err = -EINVAL;
  2225. else
  2226. icsk->icsk_syn_retries = val;
  2227. break;
  2228. case TCP_LINGER2:
  2229. if (val < 0)
  2230. tp->linger2 = -1;
  2231. else if (val > sysctl_tcp_fin_timeout / HZ)
  2232. tp->linger2 = 0;
  2233. else
  2234. tp->linger2 = val * HZ;
  2235. break;
  2236. case TCP_DEFER_ACCEPT:
  2237. /* Translate value in seconds to number of retransmits */
  2238. icsk->icsk_accept_queue.rskq_defer_accept =
  2239. secs_to_retrans(val, TCP_TIMEOUT_INIT / HZ,
  2240. TCP_RTO_MAX / HZ);
  2241. break;
  2242. case TCP_WINDOW_CLAMP:
  2243. if (!val) {
  2244. if (sk->sk_state != TCP_CLOSE) {
  2245. err = -EINVAL;
  2246. break;
  2247. }
  2248. tp->window_clamp = 0;
  2249. } else
  2250. tp->window_clamp = val < SOCK_MIN_RCVBUF / 2 ?
  2251. SOCK_MIN_RCVBUF / 2 : val;
  2252. break;
  2253. case TCP_QUICKACK:
  2254. if (!val) {
  2255. icsk->icsk_ack.pingpong = 1;
  2256. } else {
  2257. icsk->icsk_ack.pingpong = 0;
  2258. if ((1 << sk->sk_state) &
  2259. (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT) &&
  2260. inet_csk_ack_scheduled(sk)) {
  2261. icsk->icsk_ack.pending |= ICSK_ACK_PUSHED;
  2262. tcp_cleanup_rbuf(sk, 1);
  2263. if (!(val & 1))
  2264. icsk->icsk_ack.pingpong = 1;
  2265. }
  2266. }
  2267. break;
  2268. #ifdef CONFIG_TCP_MD5SIG
  2269. case TCP_MD5SIG:
  2270. /* Read the IP->Key mappings from userspace */
  2271. err = tp->af_specific->md5_parse(sk, optval, optlen);
  2272. break;
  2273. #endif
  2274. case TCP_USER_TIMEOUT:
  2275. /* Cap the max timeout in ms TCP will retry/retrans
  2276. * before giving up and aborting (ETIMEDOUT) a connection.
  2277. */
  2278. if (val < 0)
  2279. err = -EINVAL;
  2280. else
  2281. icsk->icsk_user_timeout = msecs_to_jiffies(val);
  2282. break;
  2283. case TCP_FASTOPEN:
  2284. if (val >= 0 && ((1 << sk->sk_state) & (TCPF_CLOSE |
  2285. TCPF_LISTEN)))
  2286. err = fastopen_init_queue(sk, val);
  2287. else
  2288. err = -EINVAL;
  2289. break;
  2290. case TCP_TIMESTAMP:
  2291. if (!tp->repair)
  2292. err = -EPERM;
  2293. else
  2294. tp->tsoffset = val - tcp_time_stamp;
  2295. break;
  2296. case TCP_NOTSENT_LOWAT:
  2297. tp->notsent_lowat = val;
  2298. sk->sk_write_space(sk);
  2299. break;
  2300. default:
  2301. err = -ENOPROTOOPT;
  2302. break;
  2303. }
  2304. release_sock(sk);
  2305. return err;
  2306. }
  2307. int tcp_setsockopt(struct sock *sk, int level, int optname, char __user *optval,
  2308. unsigned int optlen)
  2309. {
  2310. const struct inet_connection_sock *icsk = inet_csk(sk);
  2311. if (level != SOL_TCP)
  2312. return icsk->icsk_af_ops->setsockopt(sk, level, optname,
  2313. optval, optlen);
  2314. return do_tcp_setsockopt(sk, level, optname, optval, optlen);
  2315. }
  2316. EXPORT_SYMBOL(tcp_setsockopt);
  2317. #ifdef CONFIG_COMPAT
  2318. int compat_tcp_setsockopt(struct sock *sk, int level, int optname,
  2319. char __user *optval, unsigned int optlen)
  2320. {
  2321. if (level != SOL_TCP)
  2322. return inet_csk_compat_setsockopt(sk, level, optname,
  2323. optval, optlen);
  2324. return do_tcp_setsockopt(sk, level, optname, optval, optlen);
  2325. }
  2326. EXPORT_SYMBOL(compat_tcp_setsockopt);
  2327. #endif
  2328. /* Return information about state of tcp endpoint in API format. */
  2329. void tcp_get_info(const struct sock *sk, struct tcp_info *info)
  2330. {
  2331. const struct tcp_sock *tp = tcp_sk(sk);
  2332. const struct inet_connection_sock *icsk = inet_csk(sk);
  2333. u32 now = tcp_time_stamp;
  2334. memset(info, 0, sizeof(*info));
  2335. info->tcpi_state = sk->sk_state;
  2336. info->tcpi_ca_state = icsk->icsk_ca_state;
  2337. info->tcpi_retransmits = icsk->icsk_retransmits;
  2338. info->tcpi_probes = icsk->icsk_probes_out;
  2339. info->tcpi_backoff = icsk->icsk_backoff;
  2340. if (tp->rx_opt.tstamp_ok)
  2341. info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
  2342. if (tcp_is_sack(tp))
  2343. info->tcpi_options |= TCPI_OPT_SACK;
  2344. if (tp->rx_opt.wscale_ok) {
  2345. info->tcpi_options |= TCPI_OPT_WSCALE;
  2346. info->tcpi_snd_wscale = tp->rx_opt.snd_wscale;
  2347. info->tcpi_rcv_wscale = tp->rx_opt.rcv_wscale;
  2348. }
  2349. if (tp->ecn_flags & TCP_ECN_OK)
  2350. info->tcpi_options |= TCPI_OPT_ECN;
  2351. if (tp->ecn_flags & TCP_ECN_SEEN)
  2352. info->tcpi_options |= TCPI_OPT_ECN_SEEN;
  2353. if (tp->syn_data_acked)
  2354. info->tcpi_options |= TCPI_OPT_SYN_DATA;
  2355. info->tcpi_rto = jiffies_to_usecs(icsk->icsk_rto);
  2356. info->tcpi_ato = jiffies_to_usecs(icsk->icsk_ack.ato);
  2357. info->tcpi_snd_mss = tp->mss_cache;
  2358. info->tcpi_rcv_mss = icsk->icsk_ack.rcv_mss;
  2359. if (sk->sk_state == TCP_LISTEN) {
  2360. info->tcpi_unacked = sk->sk_ack_backlog;
  2361. info->tcpi_sacked = sk->sk_max_ack_backlog;
  2362. } else {
  2363. info->tcpi_unacked = tp->packets_out;
  2364. info->tcpi_sacked = tp->sacked_out;
  2365. }
  2366. info->tcpi_lost = tp->lost_out;
  2367. info->tcpi_retrans = tp->retrans_out;
  2368. info->tcpi_fackets = tp->fackets_out;
  2369. info->tcpi_last_data_sent = jiffies_to_msecs(now - tp->lsndtime);
  2370. info->tcpi_last_data_recv = jiffies_to_msecs(now - icsk->icsk_ack.lrcvtime);
  2371. info->tcpi_last_ack_recv = jiffies_to_msecs(now - tp->rcv_tstamp);
  2372. info->tcpi_pmtu = icsk->icsk_pmtu_cookie;
  2373. info->tcpi_rcv_ssthresh = tp->rcv_ssthresh;
  2374. info->tcpi_rtt = jiffies_to_usecs(tp->srtt)>>3;
  2375. info->tcpi_rttvar = jiffies_to_usecs(tp->mdev)>>2;
  2376. info->tcpi_snd_ssthresh = tp->snd_ssthresh;
  2377. info->tcpi_snd_cwnd = tp->snd_cwnd;
  2378. info->tcpi_advmss = tp->advmss;
  2379. info->tcpi_reordering = tp->reordering;
  2380. info->tcpi_rcv_rtt = jiffies_to_usecs(tp->rcv_rtt_est.rtt)>>3;
  2381. info->tcpi_rcv_space = tp->rcvq_space.space;
  2382. info->tcpi_total_retrans = tp->total_retrans;
  2383. }
  2384. EXPORT_SYMBOL_GPL(tcp_get_info);
  2385. static int do_tcp_getsockopt(struct sock *sk, int level,
  2386. int optname, char __user *optval, int __user *optlen)
  2387. {
  2388. struct inet_connection_sock *icsk = inet_csk(sk);
  2389. struct tcp_sock *tp = tcp_sk(sk);
  2390. int val, len;
  2391. if (get_user(len, optlen))
  2392. return -EFAULT;
  2393. len = min_t(unsigned int, len, sizeof(int));
  2394. if (len < 0)
  2395. return -EINVAL;
  2396. switch (optname) {
  2397. case TCP_MAXSEG:
  2398. val = tp->mss_cache;
  2399. if (!val && ((1 << sk->sk_state) & (TCPF_CLOSE | TCPF_LISTEN)))
  2400. val = tp->rx_opt.user_mss;
  2401. if (tp->repair)
  2402. val = tp->rx_opt.mss_clamp;
  2403. break;
  2404. case TCP_NODELAY:
  2405. val = !!(tp->nonagle&TCP_NAGLE_OFF);
  2406. break;
  2407. case TCP_CORK:
  2408. val = !!(tp->nonagle&TCP_NAGLE_CORK);
  2409. break;
  2410. case TCP_KEEPIDLE:
  2411. val = keepalive_time_when(tp) / HZ;
  2412. break;
  2413. case TCP_KEEPINTVL:
  2414. val = keepalive_intvl_when(tp) / HZ;
  2415. break;
  2416. case TCP_KEEPCNT:
  2417. val = keepalive_probes(tp);
  2418. break;
  2419. case TCP_SYNCNT:
  2420. val = icsk->icsk_syn_retries ? : sysctl_tcp_syn_retries;
  2421. break;
  2422. case TCP_LINGER2:
  2423. val = tp->linger2;
  2424. if (val >= 0)
  2425. val = (val ? : sysctl_tcp_fin_timeout) / HZ;
  2426. break;
  2427. case TCP_DEFER_ACCEPT:
  2428. val = retrans_to_secs(icsk->icsk_accept_queue.rskq_defer_accept,
  2429. TCP_TIMEOUT_INIT / HZ, TCP_RTO_MAX / HZ);
  2430. break;
  2431. case TCP_WINDOW_CLAMP:
  2432. val = tp->window_clamp;
  2433. break;
  2434. case TCP_INFO: {
  2435. struct tcp_info info;
  2436. if (get_user(len, optlen))
  2437. return -EFAULT;
  2438. tcp_get_info(sk, &info);
  2439. len = min_t(unsigned int, len, sizeof(info));
  2440. if (put_user(len, optlen))
  2441. return -EFAULT;
  2442. if (copy_to_user(optval, &info, len))
  2443. return -EFAULT;
  2444. return 0;
  2445. }
  2446. case TCP_QUICKACK:
  2447. val = !icsk->icsk_ack.pingpong;
  2448. break;
  2449. case TCP_CONGESTION:
  2450. if (get_user(len, optlen))
  2451. return -EFAULT;
  2452. len = min_t(unsigned int, len, TCP_CA_NAME_MAX);
  2453. if (put_user(len, optlen))
  2454. return -EFAULT;
  2455. if (copy_to_user(optval, icsk->icsk_ca_ops->name, len))
  2456. return -EFAULT;
  2457. return 0;
  2458. case TCP_THIN_LINEAR_TIMEOUTS:
  2459. val = tp->thin_lto;
  2460. break;
  2461. case TCP_THIN_DUPACK:
  2462. val = tp->thin_dupack;
  2463. break;
  2464. case TCP_REPAIR:
  2465. val = tp->repair;
  2466. break;
  2467. case TCP_REPAIR_QUEUE:
  2468. if (tp->repair)
  2469. val = tp->repair_queue;
  2470. else
  2471. return -EINVAL;
  2472. break;
  2473. case TCP_QUEUE_SEQ:
  2474. if (tp->repair_queue == TCP_SEND_QUEUE)
  2475. val = tp->write_seq;
  2476. else if (tp->repair_queue == TCP_RECV_QUEUE)
  2477. val = tp->rcv_nxt;
  2478. else
  2479. return -EINVAL;
  2480. break;
  2481. case TCP_USER_TIMEOUT:
  2482. val = jiffies_to_msecs(icsk->icsk_user_timeout);
  2483. break;
  2484. case TCP_TIMESTAMP:
  2485. val = tcp_time_stamp + tp->tsoffset;
  2486. break;
  2487. case TCP_NOTSENT_LOWAT:
  2488. val = tp->notsent_lowat;
  2489. break;
  2490. default:
  2491. return -ENOPROTOOPT;
  2492. }
  2493. if (put_user(len, optlen))
  2494. return -EFAULT;
  2495. if (copy_to_user(optval, &val, len))
  2496. return -EFAULT;
  2497. return 0;
  2498. }
  2499. int tcp_getsockopt(struct sock *sk, int level, int optname, char __user *optval,
  2500. int __user *optlen)
  2501. {
  2502. struct inet_connection_sock *icsk = inet_csk(sk);
  2503. if (level != SOL_TCP)
  2504. return icsk->icsk_af_ops->getsockopt(sk, level, optname,
  2505. optval, optlen);
  2506. return do_tcp_getsockopt(sk, level, optname, optval, optlen);
  2507. }
  2508. EXPORT_SYMBOL(tcp_getsockopt);
  2509. #ifdef CONFIG_COMPAT
  2510. int compat_tcp_getsockopt(struct sock *sk, int level, int optname,
  2511. char __user *optval, int __user *optlen)
  2512. {
  2513. if (level != SOL_TCP)
  2514. return inet_csk_compat_getsockopt(sk, level, optname,
  2515. optval, optlen);
  2516. return do_tcp_getsockopt(sk, level, optname, optval, optlen);
  2517. }
  2518. EXPORT_SYMBOL(compat_tcp_getsockopt);
  2519. #endif
  2520. #ifdef CONFIG_TCP_MD5SIG
  2521. static struct tcp_md5sig_pool __percpu *tcp_md5sig_pool __read_mostly;
  2522. static DEFINE_MUTEX(tcp_md5sig_mutex);
  2523. static void __tcp_free_md5sig_pool(struct tcp_md5sig_pool __percpu *pool)
  2524. {
  2525. int cpu;
  2526. for_each_possible_cpu(cpu) {
  2527. struct tcp_md5sig_pool *p = per_cpu_ptr(pool, cpu);
  2528. if (p->md5_desc.tfm)
  2529. crypto_free_hash(p->md5_desc.tfm);
  2530. }
  2531. free_percpu(pool);
  2532. }
  2533. static void __tcp_alloc_md5sig_pool(void)
  2534. {
  2535. int cpu;
  2536. struct tcp_md5sig_pool __percpu *pool;
  2537. pool = alloc_percpu(struct tcp_md5sig_pool);
  2538. if (!pool)
  2539. return;
  2540. for_each_possible_cpu(cpu) {
  2541. struct crypto_hash *hash;
  2542. hash = crypto_alloc_hash("md5", 0, CRYPTO_ALG_ASYNC);
  2543. if (IS_ERR_OR_NULL(hash))
  2544. goto out_free;
  2545. per_cpu_ptr(pool, cpu)->md5_desc.tfm = hash;
  2546. }
  2547. /* before setting tcp_md5sig_pool, we must commit all writes
  2548. * to memory. See ACCESS_ONCE() in tcp_get_md5sig_pool()
  2549. */
  2550. smp_wmb();
  2551. tcp_md5sig_pool = pool;
  2552. return;
  2553. out_free:
  2554. __tcp_free_md5sig_pool(pool);
  2555. }
  2556. bool tcp_alloc_md5sig_pool(void)
  2557. {
  2558. if (unlikely(!tcp_md5sig_pool)) {
  2559. mutex_lock(&tcp_md5sig_mutex);
  2560. if (!tcp_md5sig_pool)
  2561. __tcp_alloc_md5sig_pool();
  2562. mutex_unlock(&tcp_md5sig_mutex);
  2563. }
  2564. return tcp_md5sig_pool != NULL;
  2565. }
  2566. EXPORT_SYMBOL(tcp_alloc_md5sig_pool);
  2567. /**
  2568. * tcp_get_md5sig_pool - get md5sig_pool for this user
  2569. *
  2570. * We use percpu structure, so if we succeed, we exit with preemption
  2571. * and BH disabled, to make sure another thread or softirq handling
  2572. * wont try to get same context.
  2573. */
  2574. struct tcp_md5sig_pool *tcp_get_md5sig_pool(void)
  2575. {
  2576. struct tcp_md5sig_pool __percpu *p;
  2577. local_bh_disable();
  2578. p = ACCESS_ONCE(tcp_md5sig_pool);
  2579. if (p)
  2580. return __this_cpu_ptr(p);
  2581. local_bh_enable();
  2582. return NULL;
  2583. }
  2584. EXPORT_SYMBOL(tcp_get_md5sig_pool);
  2585. int tcp_md5_hash_header(struct tcp_md5sig_pool *hp,
  2586. const struct tcphdr *th)
  2587. {
  2588. struct scatterlist sg;
  2589. struct tcphdr hdr;
  2590. int err;
  2591. /* We are not allowed to change tcphdr, make a local copy */
  2592. memcpy(&hdr, th, sizeof(hdr));
  2593. hdr.check = 0;
  2594. /* options aren't included in the hash */
  2595. sg_init_one(&sg, &hdr, sizeof(hdr));
  2596. err = crypto_hash_update(&hp->md5_desc, &sg, sizeof(hdr));
  2597. return err;
  2598. }
  2599. EXPORT_SYMBOL(tcp_md5_hash_header);
  2600. int tcp_md5_hash_skb_data(struct tcp_md5sig_pool *hp,
  2601. const struct sk_buff *skb, unsigned int header_len)
  2602. {
  2603. struct scatterlist sg;
  2604. const struct tcphdr *tp = tcp_hdr(skb);
  2605. struct hash_desc *desc = &hp->md5_desc;
  2606. unsigned int i;
  2607. const unsigned int head_data_len = skb_headlen(skb) > header_len ?
  2608. skb_headlen(skb) - header_len : 0;
  2609. const struct skb_shared_info *shi = skb_shinfo(skb);
  2610. struct sk_buff *frag_iter;
  2611. sg_init_table(&sg, 1);
  2612. sg_set_buf(&sg, ((u8 *) tp) + header_len, head_data_len);
  2613. if (crypto_hash_update(desc, &sg, head_data_len))
  2614. return 1;
  2615. for (i = 0; i < shi->nr_frags; ++i) {
  2616. const struct skb_frag_struct *f = &shi->frags[i];
  2617. unsigned int offset = f->page_offset;
  2618. struct page *page = skb_frag_page(f) + (offset >> PAGE_SHIFT);
  2619. sg_set_page(&sg, page, skb_frag_size(f),
  2620. offset_in_page(offset));
  2621. if (crypto_hash_update(desc, &sg, skb_frag_size(f)))
  2622. return 1;
  2623. }
  2624. skb_walk_frags(skb, frag_iter)
  2625. if (tcp_md5_hash_skb_data(hp, frag_iter, 0))
  2626. return 1;
  2627. return 0;
  2628. }
  2629. EXPORT_SYMBOL(tcp_md5_hash_skb_data);
  2630. int tcp_md5_hash_key(struct tcp_md5sig_pool *hp, const struct tcp_md5sig_key *key)
  2631. {
  2632. struct scatterlist sg;
  2633. sg_init_one(&sg, key->key, key->keylen);
  2634. return crypto_hash_update(&hp->md5_desc, &sg, key->keylen);
  2635. }
  2636. EXPORT_SYMBOL(tcp_md5_hash_key);
  2637. #endif
  2638. void tcp_done(struct sock *sk)
  2639. {
  2640. struct request_sock *req = tcp_sk(sk)->fastopen_rsk;
  2641. if (sk->sk_state == TCP_SYN_SENT || sk->sk_state == TCP_SYN_RECV)
  2642. TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_ATTEMPTFAILS);
  2643. tcp_set_state(sk, TCP_CLOSE);
  2644. tcp_clear_xmit_timers(sk);
  2645. if (req != NULL)
  2646. reqsk_fastopen_remove(sk, req, false);
  2647. sk->sk_shutdown = SHUTDOWN_MASK;
  2648. if (!sock_flag(sk, SOCK_DEAD))
  2649. sk->sk_state_change(sk);
  2650. else
  2651. inet_csk_destroy_sock(sk);
  2652. }
  2653. EXPORT_SYMBOL_GPL(tcp_done);
  2654. extern struct tcp_congestion_ops tcp_reno;
  2655. static __initdata unsigned long thash_entries;
  2656. static int __init set_thash_entries(char *str)
  2657. {
  2658. ssize_t ret;
  2659. if (!str)
  2660. return 0;
  2661. ret = kstrtoul(str, 0, &thash_entries);
  2662. if (ret)
  2663. return 0;
  2664. return 1;
  2665. }
  2666. __setup("thash_entries=", set_thash_entries);
  2667. void tcp_init_mem(struct net *net)
  2668. {
  2669. unsigned long limit = nr_free_buffer_pages() / 8;
  2670. limit = max(limit, 128UL);
  2671. net->ipv4.sysctl_tcp_mem[0] = limit / 4 * 3;
  2672. net->ipv4.sysctl_tcp_mem[1] = limit;
  2673. net->ipv4.sysctl_tcp_mem[2] = net->ipv4.sysctl_tcp_mem[0] * 2;
  2674. }
  2675. void __init tcp_init(void)
  2676. {
  2677. struct sk_buff *skb = NULL;
  2678. unsigned long limit;
  2679. int max_rshare, max_wshare, cnt;
  2680. unsigned int i;
  2681. BUILD_BUG_ON(sizeof(struct tcp_skb_cb) > sizeof(skb->cb));
  2682. percpu_counter_init(&tcp_sockets_allocated, 0);
  2683. percpu_counter_init(&tcp_orphan_count, 0);
  2684. tcp_hashinfo.bind_bucket_cachep =
  2685. kmem_cache_create("tcp_bind_bucket",
  2686. sizeof(struct inet_bind_bucket), 0,
  2687. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
  2688. /* Size and allocate the main established and bind bucket
  2689. * hash tables.
  2690. *
  2691. * The methodology is similar to that of the buffer cache.
  2692. */
  2693. tcp_hashinfo.ehash =
  2694. alloc_large_system_hash("TCP established",
  2695. sizeof(struct inet_ehash_bucket),
  2696. thash_entries,
  2697. 17, /* one slot per 128 KB of memory */
  2698. 0,
  2699. NULL,
  2700. &tcp_hashinfo.ehash_mask,
  2701. 0,
  2702. thash_entries ? 0 : 512 * 1024);
  2703. for (i = 0; i <= tcp_hashinfo.ehash_mask; i++)
  2704. INIT_HLIST_NULLS_HEAD(&tcp_hashinfo.ehash[i].chain, i);
  2705. if (inet_ehash_locks_alloc(&tcp_hashinfo))
  2706. panic("TCP: failed to alloc ehash_locks");
  2707. tcp_hashinfo.bhash =
  2708. alloc_large_system_hash("TCP bind",
  2709. sizeof(struct inet_bind_hashbucket),
  2710. tcp_hashinfo.ehash_mask + 1,
  2711. 17, /* one slot per 128 KB of memory */
  2712. 0,
  2713. &tcp_hashinfo.bhash_size,
  2714. NULL,
  2715. 0,
  2716. 64 * 1024);
  2717. tcp_hashinfo.bhash_size = 1U << tcp_hashinfo.bhash_size;
  2718. for (i = 0; i < tcp_hashinfo.bhash_size; i++) {
  2719. spin_lock_init(&tcp_hashinfo.bhash[i].lock);
  2720. INIT_HLIST_HEAD(&tcp_hashinfo.bhash[i].chain);
  2721. }
  2722. cnt = tcp_hashinfo.ehash_mask + 1;
  2723. tcp_death_row.sysctl_max_tw_buckets = cnt / 2;
  2724. sysctl_tcp_max_orphans = cnt / 2;
  2725. sysctl_max_syn_backlog = max(128, cnt / 256);
  2726. tcp_init_mem(&init_net);
  2727. /* Set per-socket limits to no more than 1/128 the pressure threshold */
  2728. limit = nr_free_buffer_pages() << (PAGE_SHIFT - 7);
  2729. max_wshare = min(4UL*1024*1024, limit);
  2730. max_rshare = min(6UL*1024*1024, limit);
  2731. sysctl_tcp_wmem[0] = SK_MEM_QUANTUM;
  2732. sysctl_tcp_wmem[1] = 16*1024;
  2733. sysctl_tcp_wmem[2] = max(64*1024, max_wshare);
  2734. sysctl_tcp_rmem[0] = SK_MEM_QUANTUM;
  2735. sysctl_tcp_rmem[1] = 87380;
  2736. sysctl_tcp_rmem[2] = max(87380, max_rshare);
  2737. pr_info("Hash tables configured (established %u bind %u)\n",
  2738. tcp_hashinfo.ehash_mask + 1, tcp_hashinfo.bhash_size);
  2739. tcp_metrics_init();
  2740. tcp_register_congestion_control(&tcp_reno);
  2741. tcp_tasklet_init();
  2742. }