tcp.c 81 KB

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