tcp.c 81 KB

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