tcp.c 86 KB

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