tcp.c 83 KB

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