tcp.c 83 KB

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