tcp.c 93 KB

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