tcp.c 89 KB

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